Self-adjusting multi-way search trees☆
References (10)
Implicit data structures for weighted elements
Inform. and Control
(1985)Symmetric Binary B-Trees: Data structure and maintenance algorithms
Acta Inform.
(1972)- et al.
Organization and maintenance of large ordered indexes
Acta Inform.
(1972) Self-organizing heuristics for implicit data structures
SIAM J. Comput.
(1984)Optimal multi-way search trees
SIAM J. Comput.
(1981)
There are more references available in the full text version of this article.
Cited by (15)
Chain-splay trees, or, how to achieve and prove log log N-competitiveness by splaying
2008, Information Processing LettersUnsuccessful search in self-adjusting data structures
1993, Journal of AlgorithmsThe splay-list: a distribution-adaptive concurrent skip-list
2023, Distributed ComputingThe splay-list: A distribution-adaptive concurrent skip-list
2020, Leibniz International Proceedings in Informatics, LIPIcsB-tries for disk-based string management
2009, VLDB Journal
- ☆
Research partially supported by a grant CCR-8722848 from the National Science Foundation.
Copyright © 1991 Published by Elsevier B.V.