Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
From MaRDI portal
Publication:5090986
Recommendations
- A New Lower Bound for Semigroup Orthogonal Range Searching
- Space-Time Trade-Offs for Orthogonal Range Queries
- Semi-group range sum revisited: query-space lower bound tightened
- New Data Structures for Orthogonal Range Queries
- Efficient top-\(k\) queries for orthogonal ranges
- On a model of indexability and its bounds for range queries
- Succinct indices for range queries with applications to orthogonal range maxima
- scientific article; zbMATH DE number 2080470
- Orthogonal range reporting, query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
- scientific article; zbMATH DE number 2086643
Cites work
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 1241835 (Why is no real title available?)
- scientific article; zbMATH DE number 1182924 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A Lower Bound on the Complexity of Orthogonal Range Queries
- A combinatorial approach to matrix theory and its applications
- Computational geometry. Algorithms and applications.
- Fractional cascading. I: A data structuring technique
- Functions of Matrices
- Lower bounds on zero-one matrices.
- Multidimensional divide-and-conquer
- The Complexity of Maintaining an Array and Computing Its Partial Sums
This page was built for publication: Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090986)
