An Explanation of Splaying

DOI10.1006/JAGM.1996.0025MaRDI QIDQ4881406zbMATH OpenOpenAlexFDO

Authors Ashok Subramanian

Publication date 15 September 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0025

zbMATH Keywords

binary search trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10)

Recommendations

• On top-down splaying
• Self-adjusting binary search trees
• A systematic analysis of splaying
• Self-adjusting binary search trees: what makes them tick?

Cited in

(9)

• Pairing heaps: the forward variant
• Competitive Online Search Trees on Trees
• A study on splay trees
• Improved bounds for multipass pairing heaps and path-balanced binary search trees
• Randomized splay trees: Theoretical and experimental results.
• On top-down splaying
• Self-adjusting binary search trees: what makes them tick?
• In pursuit of the dynamic optimality conjecture
• Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying

This page was built for publication: An Explanation of Splaying

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