The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
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
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
Small forwarding tables for fast routing lookups
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The cell probe complexity of succinct data structures
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Lower bounds for 2-dimensional range counting
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Efficient IP table lookup via adaptive stratified trees with selective reconstructions
Journal of Experimental Algorithmics (JEA)
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
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Tight lower bounds for selection in randomly ordered streams
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Data Structures with Local Update Operations
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Cell probe lower bounds for succinct data structures
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Making deterministic signatures quickly
ACM Transactions on Algorithms (TALG)
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
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
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)
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fully-functional succinct trees
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Orthogonal range searching on the RAM, revisited
Proceedings of the twenty-seventh annual symposium on Computational geometry
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Unifying the Landscape of Cell-Probe Lower Bounds
SIAM Journal on Computing
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-efficient range reporting for categorical data
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Connectivity oracles for planar graphs
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Space-bounded communication complexity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Proceedings of the sixth ACM international conference on Web search and data mining
Mihai Pǎtraşcu: obituary and open problems
ACM SIGACT News
Space-efficient data-analysis queries on grids
Theoretical Computer Science
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
Hi-index | 0.00 |
We develop a new technique for proving cell-probe lower bounds for static data structures. Previous lower bounds used a reduction to communication games, which was known not to be tight by counting arguments. We give the first lower bound for an explicit problem which breaks this communication complexity barrier. In addition, our bounds give the first separation between polynomial and near linear space. Such a separation is inherently impossible by communication complexity.Using our lower bound technique and new upper bound constructions, we obtain tight bounds for searching predecessors among a static set of integers. Given a set Y of n integers of l bits each, the goal is to efficiently find PREDECESSOR (x) = max (y ∈ Y | y ≤ x). For this purpose, we represent Y on a RAM with word length b using S ≥ nl bits of space. Defining a = lg S/n, we show that the optimal search time is, up to constant factors: min(logbn, lgl-lg n / n, lg(l/a) / lg(a/lg n * lg l/a), lg (l/a) / lg (lg (l/a) / lg (lg n / a)).In external memory (b l), it follows that the optimal strategy is to use either standard B-trees, or a RAM algorithm ignoring the larger block size. In the important case of b = l = γ lg n, for γ 1 (i.e. polynomial universes), and near linear space (such as S = n • lgO(1) n), the optimal search time is Θ(lg l). Thus, our lower bound implies the surprising conclusion that van Emde Boas' classic data structure from [FOCS'75] is optimal in this case. Note that for space n1+ε, a running time of O(lg l / lg lg l) was given by Beame and Fich [STOC'99].