On dynamic range reporting in one dimension

DOI10.1145/1060590.1060606zbMath1192.68184OpenAlexW2149592768WikidataQ56384697 ScholiaQ56384697MaRDI QIDQ3581419

Mihai Pǎtraşcu, Rasmus Pagh, Christian Worm Mortensen

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060606

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (10)

On dynamic bit-probe complexity ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ Substring Range Reporting ⋮ Substring range reporting ⋮ Orthogonal range searching in linear and almost-linear space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Space efficient linear time algorithms for BFS, DFS and applications ⋮ A Survey of Data Structures in the Bitprobe Model ⋮ On hardness of several string indexing problems

This page was built for publication: On dynamic range reporting in one dimension