Future directions in program transformations
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tight(er) worst-case bounds on dynamic searching and priority queues
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Dynamic and hierarchical spatial access method using integer searching
Proceedings of the tenth international conference on Information and knowledge management
On the existence and construction of non-extreme (a, b)-trees
Information Processing Letters
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Lower bounds for dynamic transitive closure, planar point location, and parantheses matching
Nordic Journal of Computing
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We show that a unit-cost RAM with word length w can maintain an ordered set of w-bit integers (or binary strings) under the operations search, insert, delete, nearest neighbour in O(/spl radic/(logn)) worst-case time and range queries in O(/spl radic/(logn)+size of output) worst-case time. The operations rely on AC/sup 0/ instructions only, thereby solving an open problem posed by Fredman and Willard. The data structure is simple. We also present a static data structure that can process a set of /spl Theta/O(logn) searches in O(lognloglogn) time.