Approximate Range Emptiness in Constant Time and Optimal Space

DOI10.1137/1.9781611973730.52zbMath1371.68057arXiv1407.2907OpenAlexW2951657806MaRDI QIDQ5362992

Kasper Green Larsen, Rasmus Pagh, Allan Grønlund, Mayank Goswami

Publication date: 5 October 2017

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

Full work available at URL: https://arxiv.org/abs/1407.2907

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (3)

Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Unnamed Item ⋮ Succinct Color Searching in One Dimension

This page was built for publication: Approximate Range Emptiness in Constant Time and Optimal Space