On dynamic range reporting in one dimension

DOI10.1145/1060590.1060606MaRDI QIDQ3581419zbMATH OpenOpenAlexWikidataFDO

Authors Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu

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

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

Cited in

(11)

• Orthogonal range searching in linear and almost-linear space
• Space efficient linear time algorithms for BFS, DFS and applications
• On hardness of several string indexing problems
• On dynamic bit-probe complexity
• A Survey of Data Structures in the Bitprobe Model
• Substring Range Reporting
• Towards an optimal method for dynamic planar point location
• Dynamic planar orthogonal point location in sublogarithmic time
• Succinct dynamic one-dimensional point reporting
• Substring range reporting
• Dynamic filter and retrieval with one access to modifiable memory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581419)