Self-adjusting binary search trees
- 1 July 1985
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 32 (3), 652-686
- https://doi.org/10.1145/3828.3835
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Hysterical B-treesInformation Processing Letters, 1981
- Robust balancing in B-treesPublished by Springer Nature ,1981
- Design and Analysis of a Data Structure for Representing Sorted ListsSIAM Journal on Computing, 1980
- Multidimensional B-tree: An efficient dynamic file structure for exact match queriesPublished by Springer Nature ,1980
- Heuristics That Dynamically Organize Data StructuresSIAM Journal on Computing, 1979
- Self-Organizing Binary Search TreesJournal of the ACM, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975