Improved upper bounds for pairing heaps

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 32-45

  Iacono, John ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AMORTIZED TIME; CONSTANT AMORTIZED TIME; CONSTANT FACTORS; UPPER BOUND;

ARTIFICIAL INTELLIGENCE;

EID: 84956859079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (13)

1. R. Cole. On the dynamic finger conjecture for splay trees. part ii: The proof. Technical Report Computer Science TR1995-701, New York Univerity, 1995.
2. R. Cole, B. Mishra, J. Schmidt, and A. Siegel. On the dynamic finger conjecture for splay trees. part i: Splay sorting log n-block sequences. Technical Report Computer Science TR1995-700, New York Univerity, 1995.
3. M. L. Fredman. Manuscript in preparation.
4. M. L Fredman. On the efficiency of pairing heaps and related data structures. JACM, 46(4):473-501, 1999.
5. M. L Fredman. A priority queue transform. In Workshop on Algorithm Engineer-ing, pages 243-257, 1999. LNCS 1668.
6. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1:111-129, 1986.
7. M. L Fredman and R. E. Tarjan. Fibonacci heaps and their used in improved network optimization algorithms. JACM, 34:596-615, 1987.
8. Haim Kaplan and Robert E. Tarjan. New heap data structures. Technical Report Computer Science TR-597-99, Princeton University, 1999.
9. D. D. Sleator and R. E. Tarjan. Self-adjusting binary trees. JACM, 32:652-686, 1985.
10. D. D. Sleator and R. E. Tarjan. Self-adjusting heaps. SIAM Journal of Computing, 15:52-69, 1986.
11. J. T. Stasko and J. S. Vitter. Pairing heaps: experiments and analysis. CACM, 15:234-249, 1987.
12. R. Sundar. Amoritzed Complexity of Data Structures. PhD thesis, New York University, 1991.
13. R. E. Tarjan. Sequential access in splay trees takes linear time. Combinatorica, 5:367-378, 1985.