The pairing heap: A new form of self-adjusting heap
- 1 November 1986
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4) , 111-129
- https://doi.org/10.1007/bf01840439
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fibonacci Heaps And Their Uses In Improved Network Optimization AlgorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Self-Adjusting HeapsSIAM Journal on Computing, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Efficient Implementation Of Graph Algorithms Using ContractionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Self-adjusting binary treesPublished by Association for Computing Machinery (ACM) ,1983
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Implementation and Analysis of Binomial Queue AlgorithmsSIAM Journal on Computing, 1978
- Algorithm 245: TreesortCommunications of the ACM, 1964