Generalized Template Splay: A Basic Theory and Calculus

DOI10.1093/COMJNL/47.1.10MaRDI QIDQ4828443zbMATH OpenOpenAlexFDO

Authors David J. McClurkin, George F. Georgakopoulos

Publication date 19 November 2004

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/47.1.10

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1522918
• Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
• A systematic analysis of splaying
• Experimental and Efficient Algorithms
• Self-adjusting binary search trees

Cited in

(7)

• A systematic analysis of splaying
• Chain-splay trees, or, how to achieve and prove \(\log \log N\)-competitiveness by splaying
• Competitive Online Search Trees on Trees
• Self-adjusting binary search trees: what makes them tick?
• scientific article; zbMATH DE number 1522918 (Why is no real title available?)
• Improved bounds for multipass pairing heaps and path-balanced binary search trees
• scientific article; zbMATH DE number 1953882 (Why is no real title available?)

This page was built for publication: Generalized Template Splay: A Basic Theory and Calculus

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