Self-adjusting multi-way search trees

DOI10.1016/0020-0190(91)90235-AzbMath0737.68019MaRDI QIDQ1178210

Charles U. Martel

Publication date: 26 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

online algorithmsdictionary

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

The splay-list: a distribution-adaptive concurrent skip-list, Self‐adjusting trees in practice for large text collections, Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying

Cites Work

• Unnamed Item
• Unnamed Item
• Sequential access in splay trees takes linear time
• Organization and maintenance of large ordered indexes
• Symmetric binary B-trees: Data structure and maintenance algorithms
• Self-Organizing Heuristics for Implicit Data Structures
• Implicit data structures for weighted elements
• Self-adjusting binary search trees
• Optimal Multi-Way Search Trees