Random input helps searching predecessors

Details Random input helps searching predecessors Random input helps searching predecessors

2011-04-21

arxiv.org/abs/1104.4353v1

Computer Science

Data Structures and Algorithms

Scientific paper

We solve the dynamic Predecessor Problem with high probability (whp) in constant time, using only $n^{1+\delta}$ bits of memory, for any constant $\delta > 0$. The input keys are random wrt a wider class of the well studied and practically important class of $(f_1, f_2)$-smooth distributions introduced in \cite{and:mat}. It achieves O(1) whp amortized time. Its worst-case time is $O(\sqrt{\frac{\log n}{\log \log n}})$. Also, we prove whp $O(\log \log \log n)$ time using only $n^{1+ \frac{1}{\log \log n}}= n^{1+o(1)}$ bits. Finally, we show whp $O(\log \log n)$ time using O(n) space.

Affiliated with

Also associated with

No associations

Rating

Random input helps searching predecessors 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 Random input helps searching predecessors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random input helps searching predecessors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-330003