Approximate colored range and point enclosure queries
From MaRDI portal
Publication:1018093
DOI10.1016/J.JDA.2007.10.001zbMATH Open1160.68352OpenAlexW2051856167MaRDI QIDQ1018093FDOQ1018093
Authors: Ying Kit Lai, Chung Keung Poon, Benyun Shi 
Publication date: 13 May 2009
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2007.10.001
Recommendations
Cites Work
- Multidimensional divide-and-conquer
- Universal classes of hash functions
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Title not available (Why is that?)
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Adding range restriction capability to dynamic data structures
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- New Data Structures for Orthogonal Range Queries
- Two-dimensional substring indexing.
- A new approach to rectangle intersections part I
- LATIN 2004: Theoretical Informatics
- Title not available (Why is that?)
- Algorithms and Computation
- Significant-presence range queries in categorical data.
Cited In (11)
- Colored range queries and document retrieval
- Colored Range Searching in Linear Space
- Data structures for range-aggregation over categories
- Dynamic range majority data structures
- Array range queries
- Data structures for categorical path counting queries
- Title not available (Why is that?)
- Significant-presence range queries in categorical data.
- Range majorities and minorities in arrays
- Algorithms and Computation
- Counting Colours in Compressed Strings
This page was built for publication: Approximate colored range and point enclosure queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1018093)
