The cell probe complexity of succinct data structures

Theoretical Computer Science

Volumn 379, Issue 3, 2007, Pages 405-417

  Gál, Anna ^a   Miltersen, Peter Bro ^b  

^a University of Texas at Austin   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Cell probe complexity; Polynomial evaluation with preprocessing; Succinct data structures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUERY PROCESSING;

CELL PROBE COMPLEXITY; OPTIMAL LOWER BOUND; PREPROCESSING; SUCCINCT DATA STRUCTURES;

DATA STRUCTURES;

EID: 34248595483     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.047     Document Type: Article

References (33)

1. Ajtai M. A lower bound for finding predecessors in Yao's cell probe model. Combinatorica 8 (1988) 235-247
2. Alon N., Bruck J., Naor J., Naor M., and Roth R. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38 (1992) 509-516
3. Alon N., Goldreich O., Håstad J., and Peralta R. Simple constructions of almost k-wise independent random variables. Random Structures and Algorithms 3 (1992) 289-304
4. Barkol O., and Rabani Y. Tighter bounds for nearest neighbor search and related problems in the cell probe model. Journal of Computer and System Sciences 64 (2002) 873-896
5. Beame P., and Fich F.E. Optimal bounds for the predecessor problem. Journal of Computer and System Sciences (2002) 38-72
6. Borodin A., Ostrovsky R., and Rabani Y. Lower bounds for high dimensional nearest neighbor search and related problems. Discrete and Computational Geometry - The Goodman-Pollack Festschrift. Algorithms and Combinatorics Series vol. 3143 (2003) 255-276
7. Brodnik A., and Munro J.I. Membership in constant time and almost-minimum space. SIAM Journal on Computing 28 (1999) 1627-1640
8. H. Buhrman, P.B. Miltersen, J. Radhakrishnan, S. Venkatesh, Are bitvectors optimal? in: Proc. 32th Annual ACM Symposium on Theory of Computing, STOC'00, pp. 449-458
9. A. Chakrabarti, B. Chazelle, B. Gum, A. Lvov, A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming Cube, in: Proc. 31th Annual ACM Symposium on Theory of Computing, STOC'99, pp. 305-311
10. Demaine E.D., and Lopez-Ortiz A. A linear lower bound on index size for text retrieval. Journal of Algorithms 48 (2003) 2-15
11. Elias P., and Flower R.A. The complexity of some simple retrieval problems. Journal of the Association for Computing Machinery 22 (1975) 367-379
12. Erdo{double acute}s P., and Rado R. Intersection theorems for systems of sets. Journal of London Mathematical Society 35 (1960) 85-90
13. Fredman M.L., Komlós J., and Szemerédi E. Storing a sparse table with O (1) worst case access time. Journal of the Association for Computing Machinery 31 (1984) 538-544
14. A. Gál, P.B. Miltersen, The cell probe complexity of succinct data structures, in: Proc. of 30th International Colloquium on Automata, Languages and Programming, ICALP'03, pp. 332-344
15. Goyal N., and Saks M. A Parallel Search Game. Random Structures and Algorithms 27 2 (2005) 227-234
16. R. Grossi, J.S. Vitter, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, in: Proc. 32th Annual ACM Symposium on Theory of Computing, STOC'00, pp. 397-406
17. R. Grossi, A. Gupta, J.S. Vitter, High-order entropy-compressed text indexes, in: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'03, pp. 841-850
18. Guruswami V. List decoding from erasure: Bounds and code constructions. IEEE Transactions on Information Theory 49 (2003) 2826-2833
19. Kleitman D.J., and Spencer J. Families of k-independent sets. Discrete Mathematics 6 (1973) 255-262
20. Knuth D.E. Seminumerical Algorithms. 2nd ed. The Art of Computer Programming Vol. II (1980), Addison-Wesley, Reading, MA
21. MacWilliams F.J., and Sloane N.J.A. The theory of Error-correcting Codes (1981), Elsevier/North-Holland, Amsterdam
22. U. Manber, S. Wu, GLIMPSE - A Tool to Search Through Entire Filesystems. White Paper. Available at: http://glimpse.cs.arizona.edu/
23. P.B. Miltersen, The bitprobe complexity measure revisited, in: 10th Annual Symposium on Theoretical Aspects of Computer Science, STACS'93, pp. 662-671
24. Miltersen P.B. On the cell probe complexity of polynomial evaluation. Theoretical Computer Science 143 (1995) 167-174
25. Miltersen P.B., Nisan N., Safra S., and Wigderson A. On data structures and asymmetric communication complexity. Journal of Computer and System Sciences 57 (1998) 37-49
26. Minsky M., and Papert S. Perceptrons (1969), MIT Press, Cambridge, Mass
27. Naor J., and Naor M. Small-bias probability spaces: efficient constructions and applications. SIAM Journal on Computing 22 4 (1993) 838-856
28. M. Naor, L. Schulman, A. Srinivasan, Splitters and near optimal derandomization, in: Proc. of 36th Annual IEEE Symposium on Foundations of Computer Science, FOCS'95, pp. 182-191
29. Nisan N., Rudich S., and Saks M. Products and Help Bits in Decision Trees. SIAM Journal on Computing 28 (1999) 1035-1050
30. Pagh R. Low redundancy in static dictionaries with O (1) lookup time. SIAM Journal on Computing 31 (2001) 353-363
31. J. Radhakrishnan, V. Raman, S.S. Rao, Explicit deterministic constructions for membership in the bitprobe model, in: Proc. of 9th Annual European Symposium on Algorithms, ESA'01, pp. 290-299
32. R. Raman, V. Raman, S.S. Rao, Succinct dynamic data structures, in: Proc. of 7th International Workshop on Algorithms and Data Structures, WADS'01, pp. 426-437
33. Seroussi G., and Bshouty N. Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory 34 (1988) 513-522