A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
From MaRDI portal
Publication:3628098
DOI10.1142/S0218195909002800zbMATH Open1177.68060OpenAlexW2129805272MaRDI QIDQ3628098FDOQ3628098
Authors: Yakov Nekrich 
Publication date: 19 May 2009
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195909002800
Recommendations
Cites Work
- Multidimensional divide-and-conquer
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Preserving order in a forest in less than logarithmic time and linear space
- Divided \(k-d\) trees
- Universal codeword sets and representations of the integers
- Design and implementation of an efficient priority queue
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Optimal External Memory Interval Management
- Cache-Oblivious B-Trees
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time
- Fully Dynamic Orthogonal Range Reporting on RAM
Cited In (7)
- Orthogonal range searching in linear and almost-linear space
- Fully Dynamic Orthogonal Range Reporting on RAM
- Orthogonal Range Searching in Linear and Almost-Linear Space
- Time-optimal top-\(k\) document retrieval
- Reporting and counting maximal points in a query orthogonal rectangle
- Top-\(k\) document retrieval in optimal time and linear space
- Linear space adaptive data structures for planar range reporting
This page was built for publication: A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3628098)
