Optimal Bounds for the Predecessor Problem (0)
| Venue: | In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing |
| Citations: | 57 - 0 self |
BibTeX
@INPROCEEDINGS{Beame_optimalbounds,
author = {Paul Beame and Faith E. Fich},
title = {Optimal Bounds for the Predecessor Problem},
booktitle = {In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing},
year = {},
pages = {295--304},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 extend 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.
