The amortized cost of finding the minimum

DOI10.1137/1.9781611973730.51zbMATH Open1372.68132OpenAlexW4253057519MaRDI QIDQ5362991FDOQ5362991

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

Recommendations

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

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)

Cited In (3)

• The randomized complexity of maintaining the minimum
• Algorithm Theory - SWAT 2004
• Title not available (Why is that?)

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)