A tight amortized bound for path reversal
Authors:
- David GinatDGDavid Ginat
- Daniel D SleatorDSDaniel D Sleator
- Robert E TarjanRTRobert E Tarjan
- 1 April 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (1) , 3-5
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation (CCR 8658139)
- National Science Foundation (DCR-8605962)
- Defense Advanced Research Projects Agency
- Advanced Research Projects Agency
- Office of Naval Research (NOOOM-87-K-0467)
This publication has 4 references indexed in Scilit:
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984