Self-Organizing Binary Search Trees

DOI10.1145/322092.322094MaRDI QIDQ4170254zbMATH OpenOpenAlexWikidataFDO

Authors J. Ian Munro, Brian Michael Allen

Publication date 1978

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322092.322094

Mathematics Subject Classification ID

Trees (05C05) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Cited in

(17)

• On top-down splaying
• Optimum multiway search trees
• Determining the mode
• Optimal algorithms for sensitivity analysis in associative multiplication problems
• Randomly balanced binary trees
• In pursuit of the dynamic optimality conjecture
• Expected Costs in Some Classes of Binary Search Trees
• Self-adjusting binary search trees: what makes them tick?
• Amortized Computational Complexity
• scientific article; zbMATH DE number 3733237 (Why is no real title available?)
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• Compact Difference Bound Matrices
• Smooth heaps and a dual view of self-adjusting data structures
• scientific article; zbMATH DE number 7651207 (Why is no real title available?)
• Optimal binary search trees
• Hardness amplification for dynamic binary search trees
• Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying

This page was built for publication: Self-Organizing Binary Search Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4170254)