Dynamic orthogonal range searching on the RAM, revisited
From MaRDI portal
Publication:4580102
DOI10.4230/LIPICS.SOCG.2017.28zbMATH Open1432.68505OpenAlexW3133750907MaRDI QIDQ4580102FDOQ4580102
Authors: Timothy M. Chan, Konstantinos Tsakalidis 
Publication date: 13 August 2018
Full work available at URL: https://doi.org/10.4230/LIPIcs.SoCG.2017.28
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (14)
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Space efficient dynamic orthogonal range reporting
- Fully Dynamic Orthogonal Range Reporting on RAM
- Orthogonal range searching on the RAM, revisited
- Efficient dynamic range searching using data replication
- Towards tight lower bounds for range reporting on the RAM
- Space efficient dynamic orthogonal range reporting
- Concurrent range reporting in two-dimensional space
- Near-optimal quantum algorithms for string problems
- Title not available (Why is that?)
- Repetition Detection in a Dynamic String
- Improved time and space bounds for dynamic range mode
- Amortized bounds for dynamic orthogonal range reporting
- Dynamic planar orthogonal point location in sublogarithmic time
This page was built for publication: Dynamic orthogonal range searching on the RAM, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580102)
