Tight lower bounds for halfspace range searching
From MaRDI portal
Publication:5405859
Recommendations
Cited in
(10)- Tight bounds for blind search on the integers
- How hard is half-space range searching?
- Tight lower bounds for halfspace range searching
- On range searching in the group model and combinatorial discrepancy
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Quasi-optimal range searching in spaces of finite VC-dimension
- scientific article; zbMATH DE number 1263218 (Why is no real title available?)
- Optimal partition trees
- On the importance of idempotence
- Semi-group range sum revisited: query-space lower bound tightened
This page was built for publication: Tight lower bounds for halfspace range searching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405859)