Orthogonal range searching in linear and almost-linear space
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485435 (Why is no real title available?)
- scientific article; zbMATH DE number 5764825 (Why is no real title available?)
- scientific article; zbMATH DE number 1947389 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A class of algorithms which require nonlinear time to maintain disjoint sets
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Cache-Oblivious B-Trees
- Compact representations of ordered sets
- Design and implementation of an efficient priority queue
- Divided \(k-d\) trees
- Fully Dynamic Orthogonal Range Reporting on RAM
- Multidimensional divide-and-conquer
- On dynamic range reporting in one dimension
- Optimal External Memory Interval Management
- Optimal static range reporting in one dimension
- Preserving order in a forest in less than logarithmic time and linear space
- Should Tables Be Sorted?
- Space efficient dynamic orthogonal range reporting
- Tight bounds for the partial-sums problem
- Universal codeword sets and representations of the integers
Cited in
(45)- The fine-grained complexity of multi-dimensional ordering properties
- Space efficient dynamic orthogonal range reporting
- Towards optimal range medians
- A new framework for addressing temporal range queries and some preliminary results
- Compressed text indexing with wildcards
- Linear space data structures for two types of range search
- Adaptive and approximate orthogonal range counting
- Orthogonal range searching on the RAM, revisited
- Adaptive and approximate orthogonal range counting
- A data structure for multi-dimensional range reporting
- Untangled monotonic chains and adaptive range search
- Array range queries
- Compact and succinct data structures for multidimensional orthogonal range searching
- Non-orthogonal homothetic range partial-sum query on integer grids (extended abstract)
- Efficient data structures for range searching on a grid
- External Memory Range Reporting on a Grid
- Space-efficient data-analysis queries on grids
- Sublinear time Lempel-Ziv (LZ77) factorization
- Concurrent range reporting in two-dimensional space
- New Data Structures for Orthogonal Range Queries
- Untangled monotonic chains and adaptive range search
- Space-Time Trade-Offs for Orthogonal Range Queries
- Discrete range searching primitive for the GPU and its applications
- On the difficulty of range searching
- Two-dimensional range successor in optimal time and almost linear space
- Quasi-optimal range searching in spaces of finite VC-dimension
- Space-efficient data-analysis queries on grids
- Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
- Space efficient dynamic orthogonal range reporting
- Dynamic path queries in linear space
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
- Optimal static range reporting in one dimension
- Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Submatrix maximum queries in Monge matrices are equivalent to predecessor search
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Sorted range reporting
- Space efficient data structures for dynamic orthogonal range counting
- Improved data structures for the orthogonal range successor problem
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- Efficient dynamic range searching using data replication
- Efficient Data Structures for the Orthogonal Range Successor Problem
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- scientific article; zbMATH DE number 1953879 (Why is no real title available?)
- Colored Range Searching in Linear Space
This page was built for publication: Orthogonal range searching in linear and almost-linear space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005331)
