The amortized cost of finding the minimum

DOI10.1137/1.9781611973730.51MaRDI QIDQ5362991zbMATH OpenOpenAlexFDO

Authors Haim Kaplan, Or Zamir, Uri Zwick

Publication date 5 October 2017

Published in Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973730.51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Algorithm Theory - SWAT 2004
• Melding priority queues
• Algorithm Theory - SWAT 2004
• The randomized complexity of maintaining the minimum
• Distribution-sensitive binomial queues.

Cited in

(3)

• The randomized complexity of maintaining the minimum
• Algorithm Theory - SWAT 2004
• scientific article; zbMATH DE number 2222706 (Why is no real title available?)

This page was built for publication: The amortized cost of finding the minimum

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