Splay trees as priority queues

DOI10.1080/00207168908803787zbMath0825.68335OpenAlexW2054748316MaRDI QIDQ4009700

Erkki Maekinen

Publication date: 27 September 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168908803787

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Unnamed Item
• Analysis of tree algorithms for the simulation event list
• The amortized complexity of Henriksen's algorithm
• On top-down splaying
• Amortized Computational Complexity
• Self-adjusting binary search trees

This page was built for publication: Splay trees as priority queues