Succinct color searching in one dimension

DOI10.4230/LIPICS.ISAAC.2017.30zbMATH Open1457.68287OpenAlexW2783084218MaRDI QIDQ5136249FDOQ5136249

Authors: Hicham El-Zein, J. Ian Munro, Yakov Nekrich 

Publication date: 25 November 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#El-ZeinMN17

Recommendations

• Succinct dynamic one-dimensional point reporting
• Optimal color range reporting in one dimension
• Colored Range Searching in Linear Space
• Colored range queries and document retrieval
• scientific article; zbMATH DE number 1830754

zbMATH Keywords

computational geometryrange searchingsuccinct data structures

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Optimal succinctness for range minimum queries
• Colored range queries and document retrieval
• Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
• Title not available (Why is that?)
• Time-space trade-offs for predecessor search
• Title not available (Why is that?)
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• A lower bound for finding predecessors in Yao's cell probe model
• Surpassing the information theoretic bound with fusion trees
• Succinct indices for range queries with applications to orthogonal range maxima
• Counting Colours in Compressed Strings
• New upper bounds for generalized intersection searching problems
• Succinct geometric indexes supporting point location queries
• Succinct and Implicit Data Structures for Computational Geometry
• Approximate Range Emptiness in Constant Time and Optimal Space
• Efficient range searching for categorical and plain data
• Adaptive and Approximate Orthogonal Range Counting
• Optimal bounds for the predecessor problem
• Optimal color range reporting in one dimension
• Dynamic Compressed Strings with Random Access

Cited In (7)

• Title not available (Why is that?)
• Optimal color range reporting in one dimension
• Adaptive data structures for 2D dominance colored range counting
• Data structures for categorical path counting queries
• Title not available (Why is that?)
• On approximate colored path counting
• Approximate query processing over static sets and sliding windows

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)