On the importance of idempotence
From MaRDI portal
Publication:2931419
DOI10.1145/1132516.1132598zbMath1301.68263OpenAlexW2165576953MaRDI QIDQ2931419
David M. Mount, Sunil Arya, Theocharis Malamatos
Publication date: 25 November 2014
Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1132516.1132598
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Approximation algorithms (68W25)
Related Items
On semialgebraic range reporting ⋮ Tight lower bounds for halfspace range searching ⋮ Approximate range searching: The absolute model ⋮ Enclosing weighted points with an almost-unit ball ⋮ The effect of corners on the complexity of approximate range searching ⋮ A New Lower Bound for Semigroup Orthogonal Range Searching
This page was built for publication: On the importance of idempotence
