Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Hash functions for priority queues
Information and Control
A lower bound on the complexity of the union-split-find problem
SIAM Journal on Computing
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
New bounds in cell probe model
New bounds in cell probe model
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Lower bounds for union-split-find related problems on random access machines
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
Computer organization and design (2nd ed.): the hardware/software interface
Computer organization and design (2nd ed.): the hardware/software interface
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
Fusion trees can be implemented with AC0 instructions only
Theoretical Computer Science
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
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
Faster deterministic dictionaries
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Optimal static range reporting in one dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The discrepancy method: randomness and complexity
The discrepancy method: randomness and complexity
Toward optimal ε-Approximate nearest neighbor algorithms
Journal of Algorithms
Tables Should Be Sorted (On Random Access Machines)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds
WADS '97 Proceedings of the 5th International Workshop on Algorithms and Data Structures
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Predecessor Queries in Dynamic Integer Sets
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Sorting and Searching on the Word RAM
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Geometric Searching over the Rationals
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Sublogarithmic searching without multiplications
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Static Dictionaries on RAMs: Query Time is Necessary and Sufficient
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Tight bounds for the partial-sums problem
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for dynamic connectivity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Information and Computation
On dynamic range reporting in one dimension
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Worst case constant time priority queue
Journal of Systems and Software
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Adjacency queries in dynamic sparse graphs
Information Processing Letters
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Dynamic text and static pattern matching
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Voronoi diagrams in n · 2o(√lg lg n) time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Randomization does not help searching predecessors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Making deterministic signatures quickly
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Equivalence between priority queues and sorting
Journal of the ACM (JACM)
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
Alternation and redundancy analysis of the intersection problem
ACM Transactions on Algorithms (TALG)
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Succinct Representations of Arbitrary Graphs
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A note on predecessor searching in the pointer machine model
Information Processing Letters
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data Structures for Approximate Orthogonal Range Counting
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
External memory range reporting on a grid
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
The limits of buffering: a tight lower bound for dynamic membership in the external memory model
Proceedings of the forty-second ACM symposium on Theory of computing
Connectivity oracles for failure prone graphs
Proceedings of the forty-second ACM symposium on Theory of computing
ACM Transactions on Computation Theory (TOCT)
Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Theoretical Computer Science
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Predecessor queries in constant time?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dynamic interpolation search revisited
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Dynamic Indexability and the Optimality of B-Trees
Journal of the ACM (JACM)
Fast local searches and updates in bounded universes
Computational Geometry: Theory and Applications
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Succinct encoding of arbitrary graphs
Theoretical Computer Science
| Hi-index | 0.00 |
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 compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models.