Splay trees as priority queues

DOI10.1080/00207168908803787MaRDI QIDQ4009700zbMATH OpenOpenAlexFDO

Authors Erkki Mäkinen

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

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

Cites work

• Amortized Computational Complexity
• Analysis of tree algorithms for the simulation event list
• scientific article; zbMATH DE number 4088895 (Why is no real title available?)
• On top-down splaying
• Self-adjusting binary search trees
• The amortized complexity of Henriksen's algorithm

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

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