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

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

2011-09-18

arxiv.org/abs/1109.3890v1

Computer Science

Data Structures and Algorithms

Extended version of a paper accepted to ISAAC 2011

Scientific paper

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(\log n)$ 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.

Affiliated with

Also associated with

No associations

Rating

A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-561328