Cache-oblivious planar orthogonal range searching and counting
From MaRDI portal
Recommendations
- Cache-oblivious data structures for orthogonal range searching
- A general approach for cache-oblivious range reporting and approximate range counting
- A general approach for cache-oblivious range reporting and approximate range counting
- Improved space bounds for cache-oblivious range reporting
- Cache-oblivious range reporting with optimal queries requires superlinear space
Cited in
(14)- Cache-oblivious R-trees
- Geometric BWT: compressed text indexing via sparse suffixes and range searching
- Cache-oblivious iterated predecessor queries via range coalescing
- Cache-oblivious data structures for orthogonal range searching
- Improved space bounds for cache-oblivious range reporting
- Cache-oblivious range reporting with optimal queries requires superlinear space
- A general approach for cache-oblivious range reporting and approximate range counting
- Orthogonal range searching on the RAM, revisited
- Cache-oblivious range reporting with optimal queries requires superlinear space
- scientific article; zbMATH DE number 6297698 (Why is no real title available?)
- Cache-oblivious index for approximate string matching
- I/O-efficient data structures for colored range and prefix reporting
- scientific article; zbMATH DE number 7740901 (Why is no real title available?)
- A general approach for cache-oblivious range reporting and approximate range counting
This page was built for publication: Cache-oblivious planar orthogonal range searching and counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370609)