The cell probe model is a general, combinatorial model of data structures. We give a survey of known results about the cell probe complexity of static and dynamic data structure problems, with an emphasis on techniques for proving lower bounds.
|
374
|
Communication Complexity
– Kushilevitz, Nisan
- 1997
|
|
316
|
Approximate nearest neighbors: towards removing the curse of dimensionality
– Indyk, Motwani
- 1998
|
|
222
|
Fast probabilistic algorithms for Hamiltonian circuits and matchings
– Angluin, Valiant
- 1979
|
|
179
|
Storing a sparse table with O(1) worst case access time
– Fredman, Komlós, et al.
- 1984
|
|
174
|
Checking computations in polylogarithmic time
– Babai, Fortnow, et al.
- 1991
|
|
131
|
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
– Fredman, Willard
- 1994
|
|
117
|
The Design of Dynamic Data Structures
– Overmars
- 1983
|
|
113
|
Should tables be sorted
– Yao
- 1981
|
|
111
|
The cell probe complexity of dynamic data structures
– Fredman, Saks
- 1989
|
|
98
|
Surpassing the information theoretic bound with fusion trees
– Fredman, Willard
- 1993
|
|
77
|
Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
– Holm, Lichtenberg, et al.
- 2001
|
|
61
|
On data structures and asymmetric communication complexity
– Miltersen, Nisan, et al.
- 1998
|
|
60
|
Optimal bounds for the predecessor problem
– Beame, Fich
- 1999
|
|
55
|
Membership in Constant Time and Almost-Minimum Space
– Brodnik, Munro
- 1999
|
|
54
|
Maintenance of a minimum spanning forest in a dynamic planar graph
– Eppstein, Italiano, et al.
- 1990
|
|
47
|
A non-linear time lower bound for boolean branching programs
– Ajtai
- 2000
|
|
41
|
Sublogarithmic searching without multiplications
– Andersson
- 1995
|
|
39
|
A lower bound for finding predecessors in Yao's cell probe model
– Ajtai
- 1988
|
|
37
|
The complexity of maintaining an array and computing its partial sums
– Fredman
- 1982
|
|
37
|
Lower bounds for Union-Split-Find related problems on random access machines
– Miltersen
- 1994
|
|
35
|
Lower bounds for high dimensional nearest neighbor search and related problems
– Borodin, Ostrovsky, et al.
|
|
34
|
Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs
– King
- 1999
|
|
32
|
Sorting and Searching on the Word RAM
– Hagerup
- 1998
|
|
30
|
Faster deterministic sorting and searching in linear space
– Andersson
- 1996
|
|
28
|
Optimal algorithms for list indexing and subset rank
– Dietz
- 1989
|
|
28
|
Lower bounds for fully dynamic connectivity problems in graphs. AIgorithmica
– Fredman, Henzinger
- 1998
|
|
28
|
Data Structures for Traveling Salesmen
– Fredman, Johnson, et al.
- 1995
|
|
27
|
Are bitvectors optimal
– Buhrman, Miltersen, et al.
- 2002
|
|
26
|
Marked ancestor problems
– Alstrup, Husfeldt, et al.
- 1998
|
|
26
|
Near-optimal fully-dynamic graph connectivity
– Thorup
- 2000
|
|
20
|
Maintaining minimum spanning trees in dynamic graphs
– Henzinger, King
- 1997
|
|
19
|
Low redundancy in static dictionaries with O(1) lookup time
– Pagh
- 1999
|
|
19
|
Dynamic maintenance of planar digraphs, with applications. Algorithmica
– Tamassia, Preparata
- 1990
|
|
19
|
Design and implementation of an ecient priority queue
– Boas, Kaas, et al.
- 1977
|
|
18
|
A lower bound on the complexity of approximate nearestneighbor searching on the hamming cube
– Chakrabarti, Chazelle, et al.
- 2003
|
|
18
|
Optimal biweighted binary trees and the complexity of maintaining partial sums
– Hampapuram, Fredman
- 1998
|
|
16
|
Dynamic word problems
– Frandsen, Miltersen, et al.
- 1993
|
|
16
|
ªEfficient Search for Approximate Nearest Neighbor
– Kushilevitz, Ostrovsky, et al.
- 1998
|
|
14
|
Log-logarithmic worst case range queries are possible
– Willard
- 1983
|
|
13
|
Observations on the complexity of generating quasi-Gray codes
– Fredman
- 1978
|
|
13
|
On the cell probe complexity of polynomial evaluation
– Miltersen
- 1995
|
|
13
|
New bounds in cell probe model
– Xiao
- 1992
|
|
12
|
Tighter bounds for nearest neighbor search and related problems in the cell probe model
– Barkol, Rabani
- 2000
|
|
11
|
The complexity of some simple retrieval problems
– Elias, Flower
- 1975
|
|
11
|
Complexity models for incremental computation, Theoretical computer Science
– Miltersen, Subramanian, et al.
- 1994
|
|
11
|
Dictionary lookup with one error
– Yao, Yao
- 1997
|
|
10
|
Dynamic algorithms for the Dyck languages
– Frandsen, Husfeldt, et al.
- 1995
|
|
10
|
A lower bound on the cell probe complexity of the dictionary problem
– Sundar
- 1993
|
|
8
|
Lower bounds for dynamic transitive closure, planar point location, and parentheses matching
– Husfeldt, Rauhe, et al.
- 1996
|
|
8
|
On dynamic algorithms for algebraic problems
– Reif, Tate
- 1997
|
