Space efficient data structures for dynamic orthogonal range counting
From MaRDI portal
Publication:390134
DOI10.1016/j.comgeo.2013.08.007zbMath1312.65022OpenAlexW2083101719MaRDI QIDQ390134
Publication date: 22 January 2014
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.08.007
Related Items (5)
Dynamic layers of maxima with applications to dominating queries ⋮ Unnamed Item ⋮ Internal dictionary matching ⋮ Dynamic path queries in linear space ⋮ Resolving SINR Queries in a Dynamic Setting
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved data structures for the orthogonal range successor problem
- Rank/select on dynamic compressed sequences and applications
- Orthogonal range searching in linear and almost-linear space
- Decomposable searching problems
- Succinct representation of labeled graphs
- Adaptive searching in succinctly encoded binary relations and tree-structured documents
- Rank and select revisited and extended
- Compressed representations of sequences and full-text indexes
- Dynamic Range Selection in Linear Space
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Succinct indexes for strings, binary relations and multilabeled trees
- Compressing and indexing labeled trees, with applications
- New Data Structures for Orthogonal Range Queries
- Adding range restriction capability to dynamic data structures
- Optimal External Memory Interval Management
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Dynamic entropy-compressed sequences and full-text indexes
- Space Efficient Data Structures for Dynamic Orthogonal Range Counting
- The cell probe complexity of dynamic range counting
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
This page was built for publication: Space efficient data structures for dynamic orthogonal range counting
