Improved range searching lower bounds
From MaRDI portal
Recommendations
- Lower bounds for orthogonal range searching: I. The reporting case
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- On range searching in the group model and combinatorial discrepancy
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- On the difficulty of range searching
Cited in
(13)- Improved range minimum queries
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- Lower bounds for orthogonal range searching: I. The reporting case
- Tight lower bounds for halfspace range searching
- scientific article; zbMATH DE number 1263218 (Why is no real title available?)
- Simplex Range Searching and Its Variants: A Review
- scientific article; zbMATH DE number 6146456 (Why is no real title available?)
- On the difficulty of range searching
- Polynomial data structure lower bounds in the group model
- A New Lower Bound for Semigroup Orthogonal Range Searching
- On range searching in the group model and combinatorial discrepancy
- scientific article; zbMATH DE number 7760157 (Why is no real title available?)
This page was built for publication: Improved range searching lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874579)