Optimal Bounds for the Predecessor Problem

  title={Optimal Bounds for the Predecessor Problem},
  author={Paul Beame and Faith Ellen},
We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed efficiently stored set. Our algorithms are for the unit-cost word-level RAM with multiplication and ex tend to give optimal dynamic algorithms. The lower bounds are proved in a much stronger communication game model, but they apply to the cell probe and RAM models and to both static and dynamic predecessor problems. 

From This Paper

Topics from this paper.


Publications citing this paper.

165 Citations

Citations per Year
Semantic Scholar estimates that this publication has 165 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…