Generalized Template Splay: A Basic Theory and Calculus

DOI10.1093/COMJNL/47.1.10zbMATH Open1090.68026OpenAlexW2071699701MaRDI QIDQ4828443FDOQ4828443

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)

Cited In (6)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Self-Adjusting Binary Search Trees: What Makes Them Tick?

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)