Functional approach to data structures and its use in multidimensional searching
SIAM Journal on Computing
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The probabilistic communication complexity of set intersection
SIAM Journal on Discrete Mathematics
On the distributional complexity of disjointness
Theoretical Computer Science
Two- and three-dimensional point location in rectangular subdivisions
Journal of Algorithms
Complexity models for incremental computation
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
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
On data structures and asymmetric communication complexity
Journal of Computer and System Sciences
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
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Multi-method dispatching: a geometric approach with applications to string matching problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Time and space efficient method-lookup for object-oriented programs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A cell probe lower bound for dynamic nearest-neighbor searching
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Internet packet filter management and rectangle geometry
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On approximate nearest neighbors under I norm
Journal of Computer and System Sciences
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 Parentheses Matching
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Time and Space Efficient Multi-method Dispatching
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Bit Probe Complexity Measure Revisited
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
New Lower Bound Techniques for Dynamic Partial Sums and Related Problems
SIAM Journal on Computing
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
Space efficient dynamic stabbing with fast queries
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Dictionary matching and indexing with errors and don't cares
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
An information statistics approach to data stream and communication complexity
Journal of Computer and System Sciences - Special issue on FOCS 2002
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
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
Cell-probe lower bounds for the partial match problem
Journal of Computer and System Sciences - Special issue: STOC 2003
Logarithmic Lower Bounds in the Cell-Probe Model
SIAM Journal on Computing
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the Optimality of the Dimensionality Reduction Method
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Higher Lower Bounds for Near-Neighbor and Further Rich Problems
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
On dynamic bit-probe complexity
Theoretical Computer Science
A data structure for multi-dimensional range reporting
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Lower bounds for 2-dimensional range counting
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
Compressing rectilinear pictures and minimizing access control lists
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Lower bounds for predecessor searching in the cell probe model
Journal of Computer and System Sciences
Hardness of Nearest Neighbor under L-infinity
FOCS '08 Proceedings of the 2008 49th 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
A little advice can be very helpful
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Succinct data structures for path queries
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Mihai Pǎtraşcu: obituary and open problems
ACM SIGACT News
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for (i) high-dimensional problems, where the goal is to show large space lower bounds; (ii) constant-dimensional geometric problems, where the goal is to bound the query time for space $O(n\cdot\mathrm{polylog}n)$; and (iii) dynamic problems, where we are looking for a trade-off between query and update time. (In the last case, our bounds are slightly weaker than the originals, losing a $\lg\lg n$ factor.) Our reductions also imply the following new results: (i) an $\Omega(\lg n/\lg\lg n)$ bound for four-dimensional range reporting, given space $O(n\cdot\mathrm{polylog}n)$ (this is quite timely, since a recent result [Y. Nekrich, in Proceedings of the 23rd ACM Symposium on Computational Geometry (SoCG), 2007, pp. 344-353] solved three-dimensional reporting in $O(\lg^2\lg n)$ time, raising the prospect that higher dimensions could also be easy); (ii) a tight space lower bound for the partial match problem, for constant query time; and (iii) the first lower bound for reachability oracles. In the process, we prove optimal randomized lower bounds for lopsided set disjointness.