Approximate colored range and point enclosure queries
From MaRDI portal
(Redirected from Publication:1018093)
Recommendations
Cites work
- scientific article; zbMATH DE number 1947378 (Why is no real title available?)
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- A new approach to rectangle intersections part I
- Adding range restriction capability to dynamic data structures
- Algorithms and Computation
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- LATIN 2004: Theoretical Informatics
- Multidimensional divide-and-conquer
- New Data Structures for Orthogonal Range Queries
- Significant-presence range queries in categorical data.
- Symmetric binary B-trees: Data structure and maintenance algorithms
- Two-dimensional substring indexing.
- Universal classes of hash functions
Cited in
(11)- Counting Colours in Compressed Strings
- 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
- scientific article; zbMATH DE number 7760157 (Why is no real title available?)
- Significant-presence range queries in categorical data.
- Range majorities and minorities in arrays
- Algorithms and Computation
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)