The amortized cost of finding the minimum

DOI10.1137/1.9781611973730.51zbMath1372.68132OpenAlexW4253057519MaRDI QIDQ5362991

Uri Zwick, Haim Kaplan, Or Zamir

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) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)

Related Items (1)

Unnamed Item

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