An optimal dynamic interval stabbing-MAX data structure?
From MaRDI portal
Recommendations
- A dynamic stabbing-max data structure with sub-logarithmic query time
- An optimal dynamic data structure for stabbing-semigroup queries
- Algorithms - ESA 2003
- Space efficient dynamic stabbing with fast queries
- An optimal data structure to handle dynamic environments in non-deterministic computations
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
- A dynamic data structure for approximate range searching
- Data Structures' Maxima
- Dynamic data structures for interval coloring
- Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems
Cited in
(7)- I/O efficient dynamic data structures for longest prefix queries
- Shortest paths among transient obstacles
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
- An optimal dynamic data structure for stabbing-semigroup queries
- A dynamic stabbing-max data structure with sub-logarithmic query time
- Space efficient dynamic stabbing with fast queries
- On the dynamic one-dimensional interval management problem in external memory
This page was built for publication: An optimal dynamic interval stabbing-MAX data structure?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921744)
