Optimal Bounds for the Predecessor Problem and Related Problems
- 1 August 2002
- journal article
- Published by Elsevier BV in Journal of Computer and System Sciences
- Vol. 65 (1), 38-72
- https://doi.org/10.1006/jcss.2002.1822
Abstract
No abstract availableThis publication has 33 references indexed in Scilit:
- Efficient regular data structures and algorithms for location and proximity problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Marked ancestor problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Toward Optimal ϵ-Approximate Nearest Neighbor AlgorithmsJournal of Algorithms, 2001
- Optimal static range reporting in one dimensionPublished by Association for Computing Machinery (ACM) ,2001
- Tight(er) worst-case bounds on dynamic searching and priority queuesPublished by Association for Computing Machinery (ACM) ,2000
- Fusion trees can be implemented with AC0 instructions onlyTheoretical Computer Science, 1999
- Trans-dichotomous algorithms without multiplication — some upper and lower boundsLecture Notes in Computer Science, 1997
- A lower bound for finding predecessors in Yao's cell probe modelCombinatorica, 1988
- Hash functions for priority queuesInformation and Control, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979