An optimal dynamic data structure for stabbing-semigroup queries
From MaRDI portal
Publication:2884577
DOI10.1137/10078791XzbMATH Open1243.68157MaRDI QIDQ2884577FDOQ2884577
Authors: Lars Arge, Haim Kaplan, Eyal Molad, Ke Yi, Pankaj K. Agarwal, Robert E. Tarjan 
Publication date: 30 May 2012
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- An optimal dynamic interval stabbing-MAX data structure?
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
- Interval Stabbing Problems in Small Integer Ranges
- Space efficient dynamic stabbing with fast queries
- A dynamic stabbing-max data structure with sub-logarithmic query time
Cited In (12)
- On the dynamic one-dimensional interval management problem in external memory
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- Optimal External Memory Interval Management
- Self-stabilizing overlays for high-dimensional monotonic searchability
- A dynamic stabbing-max data structure with sub-logarithmic query time
- Space efficient dynamic stabbing with fast queries
- Stabbing horizontal segments with vertical rays
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
- Dynamic planar orthogonal point location in sublogarithmic time
- An optimal dynamic interval stabbing-MAX data structure?
- Intersection joins under updates
- Random access in persistent strings and segment selection
This page was built for publication: An optimal dynamic data structure for stabbing-semigroup queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2884577)
