Self-Adjusting Heaps
- 1 February 1986
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 15 (1) , 52-69
- https://doi.org/10.1137/0215004
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Self-adjusting binary search treesJournal of the ACM, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Implementation and Analysis of Binomial Queue AlgorithmsSIAM Journal on Computing, 1978
- A data structure for manipulating priority queuesCommunications of the ACM, 1978
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975