Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees

DOI10.1016/J.JALGOR.2003.09.004zbMath1078.68022OpenAlexW1969274256WikidataQ124841674 ScholiaQ124841674MaRDI QIDQ4818672

George F. Georgakopoulos

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.09.004

zbMATH Keywords

dynamically self-adjusted trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (3)

Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying ⋮ On embedding subclasses of height-balanced trees in hypercubes ⋮ Embedding height balanced trees and Fibonacci trees in hypercubes

This page was built for publication: Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees