Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model
From MaRDI portal
Publication:5090986
DOI10.4230/LIPICS.FSTTCS.2018.45OpenAlexW2908474516MaRDI QIDQ5090986FDOQ5090986
Authors:
Publication date: 21 July 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2018.45
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
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Functions of Matrices
- Title not available (Why is that?)
- Multidimensional divide-and-conquer
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Title not available (Why is that?)
- Computational geometry. Algorithms and applications.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fractional cascading. I: A data structuring technique
- A combinatorial approach to matrix theory and its applications
- Lower bounds on zero-one matrices.
- A Lower Bound on the Complexity of Orthogonal Range Queries
- Title not available (Why is that?)
Cited In (1)
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)
