Fully Dynamic Orthogonal Range Reporting on RAM
From MaRDI portal
Recommendations
Cited in
(20)- Efficient range searching for categorical and plain data
- Orthogonal range searching in linear and almost-linear space
- Space efficient dynamic orthogonal range reporting
- A comparative study of dictionary matching with gaps: limitations, techniques and challenges
- Online parameterized dictionary matching with one gap
- Online recognition of dictionary with one gap
- Window queries for intersecting objects, maximal points and approximations using coresets
- Mind the gap!
- Dynamic orthogonal range searching on the RAM, revisited
- Concurrent range reporting in two-dimensional space
- Towards an optimal method for dynamic planar point location
- Near-optimal quantum algorithms for string problems
- Sorted range reporting
- scientific article; zbMATH DE number 2079392 (Why is no real title available?)
- A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
- External memory orthogonal range reporting with fast updates
- Improved dynamic graph coloring
- Amortized bounds for dynamic orthogonal range reporting
- Dynamic planar orthogonal point location in sublogarithmic time
- Sublinear time Lempel-Ziv (LZ77) factorization
This page was built for publication: Fully Dynamic Orthogonal Range Reporting on RAM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5470742)