Inherent complexity trade-offs for range query problems
From MaRDI portal
(Redirected from Publication:1056239)
Cites work
Cited in
(6)- How hard is half-space range searching?
- scientific article; zbMATH DE number 2230258 (Why is no real title available?)
- Lower Bounds on the Complexity of Polytope Range Searching
- Lower bounds on zero-one matrices.
- Query time versus redundancy trade-offs for range queries
- Partial sums on the ultra-wide word RAM
This page was built for publication: Inherent complexity trade-offs for range query problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1056239)