An Explanation of Splaying

DOI10.1006/jagm.1996.0025zbMath0845.68029OpenAlexW2068628972MaRDI QIDQ4881406

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

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

Related Items (8)

Self-Adjusting Binary Search Trees: What Makes Them Tick? ⋮ A study on splay trees ⋮ Unnamed Item ⋮ Pairing heaps: the forward variant. ⋮ Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying ⋮ In Pursuit of the Dynamic Optimality Conjecture ⋮ Competitive Online Search Trees on Trees ⋮ Randomized splay trees: Theoretical and experimental results.

This page was built for publication: An Explanation of Splaying