Abstract
In this paper we describe a dynamic data structure that answers one-dimensional stabbing-max queries in optimal O(log n/log log n) time. Our data structure uses linear space and supports insertions and deletions in O(logn) and O(log n/log log n) amortized time respectively. We also describe a O(n(log n/log log n) d-1) space data structure that answers d-dimensional stabbing-max queries in O((log n/log log n) d) time. Insertions and deletions are supported in O((log n/log log n) d log log n) and O((log n/log log n) d) amortized time respectively. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Nekrich, Y. (2011). A dynamic stabbing-max data structure with sub-logarithmic query time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7074 LNCS, pp. 170–179). https://doi.org/10.1007/978-3-642-25591-5_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
