Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
From MaRDI portal
Publication:4818672
DOI10.1016/j.jalgor.2003.09.004zbMath1078.68022WikidataQ124841674 ScholiaQ124841674MaRDI QIDQ4818672
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
Related Items
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