Recommendations
Cites work
- scientific article; zbMATH DE number 2119724 (Why is no real title available?)
- A lower bound for finding predecessors in Yao's cell probe model
- Adaptive and approximate orthogonal range counting
- Approximate range emptiness in constant time and optimal space
- Colored range queries and document retrieval
- Counting Colours in Compressed Strings
- Dynamic Compressed Strings with Random Access
- Efficient range searching for categorical and plain data
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- New upper bounds for generalized intersection searching problems
- Optimal bounds for the predecessor problem
- Optimal color range reporting in one dimension
- Optimal succinctness for range minimum queries
- Random access to grammar-compressed strings
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Succinct and Implicit Data Structures for Computational Geometry
- Succinct geometric indexes supporting point location queries
- Succinct indices for range queries with applications to orthogonal range maxima
- Surpassing the information theoretic bound with fusion trees
- Time-space trade-offs for predecessor search
Cited in
(9)- Optimal color range reporting in one dimension
- Adaptive data structures for 2D dominance colored range counting
- Data structures for categorical path counting queries
- Succinct dynamic one-dimensional point reporting
- Color-distance oracles and snippets
- Succinct data structures for nearest colored node in a tree
- Approximate query processing over static sets and sliding windows
- Approximate query processing over static sets and sliding windows
- On approximate colored path counting
This page was built for publication: Succinct color searching in one dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136249)
