Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals

DOI10.1007/978-3-319-58747-9_17zbMath1489.68062OpenAlexW2611924607MaRDI QIDQ2399373

Maarten Löffler, Elena Khramtcova

Publication date: 22 August 2017

Full work available at URL: https://dspace.library.uu.nl/handle/1874/351023

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

Dynamic smooth compressed quadtrees

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic Planar Point Location with Sub-logarithmic Local Updates
• An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries
• A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
• Data Structures with Local Update Operations
• Dynamic rectangular intersection with priorities
• Space efficient dynamic stabbing with fast queries
• Priority Search Trees

This page was built for publication: Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals