Towards a final analysis of pairing heaps

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 174-183

  Pettie, Seth ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FIBONACCI HEAPS; LOGARITHMIC TIME; PAIRING HEAPS;

COMPUTATIONAL COMPLEXITY; DATA TRANSFER; INFORMATION ANALYSIS; OPTIMAL SYSTEMS; QUEUEING THEORY; TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 33748621742     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.75     Document Type: Conference Paper

References (12)

1. E. Demaine, D. Harmon, J. Iacono, and M. Pǎtraşcu. Dynamic optimality - almost. In Proceedings 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 484-490, 2004.
2. A. Elmasry. Adaptive properties of pairing heaps. Technical Report 2001-29, DIMACS, September 2001.
3. A. Elmasry. Parameterized self-adjusting heaps. J. Algor., 52(2): 103-119, 2004.
4. M. L. Fredman. On the efficiency of pairing heaps and related data structures. J. ACM, 46(4):473-501, 1999.
5. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: a new form of self-adjusting heap. Algorithmica, 1(1):111-129, 1986.
6. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM, 34(3):596-615, 1987.
7. J. Iacono. Improved upper bounds for pairing heaps. In Scandinavian Workshop on Algorithm Theory (SWAT, LNCS 1851), pages 32-43, 2000.
8. J. S. Vitter J. T. Stasko. Pairing heaps: Experiments and analysis. Comm. ACM, 30(3):234-249, 1987.
9. K. Mehlhom and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, 2000.
10. B. M. E. Moret and H. D. Shapiro. An empirical assessment of algorithms for constructing a minimum spanning tree. In DIMACS Series on Discrete Math. and Theoretical Computer Science, 1994.
11. D. D. Sleator and R. E. Tarjan. Self-adjusting binary search trees. J. ACM, 32(3):652-686, 1985.
12. D. D. Sleator and R. E. Tarjan. Self-adjusting heaps. SIAM J. Comput., 15(1):52-69, 1986.