Near-Optimal Range Reporting Structures for Categorical Data

DOI10.1137/1.9781611973105.20zbMath1422.68050OpenAlexW4235253945MaRDI QIDQ5741728

Freek Van Walderveen, Kasper Green Larsen

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973105.20

Mathematics Subject Classification ID

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

Related Items (7)

Indexing and querying color sets of images ⋮ I/O-optimal categorical 3-sided skyline queries ⋮ Ranked Document Retrieval in External Memory ⋮ Absent Subsequences in Words ⋮ Unnamed Item ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Data structures for categorical path counting queries

This page was built for publication: Near-Optimal Range Reporting Structures for Categorical Data