The Cell Probe Complexity of Succinct Data Structures

The Cell Probe Complexity of Succinct Data Structures (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Anna Gal , Anna Gál , Peter Bro Miltersen

Venue:	In Automata, Languages and Programming, 30th International Colloquium (ICALP 2003
Citations:	27 - 0 self

BibTeX

@INPROCEEDINGS{Gal03thecell,
    author = {Anna Gal and Anna Gál and Peter Bro Miltersen},
    title = {The Cell Probe Complexity of Succinct Data Structures},
    booktitle = {In Automata, Languages and Programming, 30th International Colloquium (ICALP 2003},
    year = {2003},
    pages = {332--344},
    publisher = {Springer-Verlag}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.

Citations

1605	The Theory of Error-Correcting Codes - MacWilliams, Sloane - 1978
238	Simple Constructions of Almost k-wise Independent Random Variables - Alon, Goldreich, et al. - 1990
227	Small-bias probability spaces: Efficient constructions and applications - Naor, Naor - 1993
207	Storing a sparse table with O(1) worst case access time - Fredman, Komlós, et al. - 1984
172	Compressed suffix arrays and suffix trees with applications to text indexing and string matching - GROSSI, S
163	High-order entropy-compressed text indexes - Grossi, Gupta, et al. - 2003
145	The Art of Computer - Knuth - 1998
91	Intersection theorems for systems of sets - EBDOS, RADO - 1960
74	On data structures and asymmetric communication complexity - Miltersen, Nisan, et al. - 1998
61	Membership in constant time and almost-minimum space - Brodnik, Munro - 1999
49	Are bitvectors optimal - Buhrman, Miltersen, et al. - 2002
47	Lower bounds for highdimensional nearest neighbor search and related problems - Borodin, Ostrovsky, et al. - 1999
46	A lower bound for finding predecessors in Yao’s cell probe model - Ajtai - 1988
33	Families of k-independent sets - Kleitman, Spencer - 1973
28	Splitters and nearoptimal derandomization - Naor, Schulman, et al. - 1995
22	Products and Help Bits in Decision trees - Nisan, Saks, et al. - 1999
21	Low redundancy in static dictionaries with O(1) worst case lookup time - Pagh - 1999
18	A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube - Chakrabarti, Chazelle, et al. - 1999
17	Small-bias probability spaces: ecient constructions and applications - Naor, Naor - 1990
16	A linear lower bound on index size for text retrieval - Demaine, López-Ortiz - 1975
15	Compressed sux arrays and sux trees with applications to text indexing and string matching - Grossi, Vitter - 2000
14	On the cell probe complexity of polynomial evaluation - Miltersen - 1995
10	Tighter bounds for nearest neighbor search and related problems in the cell probe model - BARKOL, RABANI - 2000
10	The complexity of some simple retrieval problems - Elias, Flower - 1975
5	The bitprobe complexity measure revisited - Miltersen - 1993
4	A Tool to Search Through Entire Filesystems. White Paper. Available at http://glimpse.cs.arizona.edu - GLIMPSE - 1994
3	A lower bound for predecessors in Yao's cell probe model - Ajtai - 1988