A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time

DOI10.1007/978-3-642-25591-5_19zbMath1350.68078arXiv1109.3890OpenAlexW1868941998MaRDI QIDQ3104611

Yakov Nekrich

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.3890

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (3)

Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals ⋮ Random access in persistent strings and segment selection ⋮ Unnamed Item

This page was built for publication: A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time