Improved range searching lower bounds

DOI10.1145/2261250.2261275zbMath1293.68294OpenAlexW2051810819MaRDI QIDQ2874579

Huy le Nguyen, Kasper Green Larsen

Publication date: 7 August 2014

Published in: Proceedings of the twenty-eighth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.1217

zbMATH Keywords

lower boundsrange searchingpointer machinegroup model

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Simplex Range Searching and Its Variants: A Review

This page was built for publication: Improved range searching lower bounds