Are bitvectors optimal?

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1723-1744

  Buhrman, H ^a   Miltersen, P B ^b   Radhakrishnan, J ^c   Venkatesh, S ^d  

^a CWI   (Netherlands)

^b AARHUS UNIVERSITY   (Denmark)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

^d INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Bit probe model; Data structures; Set membership problem; Set systems

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; RANDOM PROCESSES; SET THEORY;

BIT PROBE MODEL; SET MEMBERSHIP PROBLEM;

INFORMATION THEORY;

EID: 0036766882     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702405292     Document Type: Article

References (37)

1. N. Alon and J. H. Spencer, The Probabilistic Method, Wiley-Interscience, New York, 1992.
2. V. Arvind and J. Köbler, On resource-bounded measure and pseudorandomness. in Proceedings of the 17th Foundations of Software Technology and Theoretical Computer Science Conference, Lecture Notes in Comput. Sci. 1346, Springer-Verlag, New York, 1997, pp. 235-249.
3. B. Bollobás, Random Graphs, Academic Press, New York, 1985.
4. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy, Checking computations in polylogarithmic time, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 21-31.
5. A. Brodnik and J. I. Munro, Membership in constant time and minimum space, in Proceedings of the 2nd Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 855, Springer-Verlag, New York, 1994, pp. 72-81.
6. A. Brodnik and J. I. Munro, Membership in constant time and almost-minimum space, SIAM J. Comput., 28 (1999), pp. 1627-1640.
7. S. Chaudhuri and J. Radhakrishnan, Deterministic restrictions in circuit complexity, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, ACM, New York, 1996, pp. 30-36.
8. A. G. Dyachkov and V. V. Rykov, Bounds on the length of disjunctive codes, Problemy Peredachi Informatsii, 18 (1982), pp. 7-13 (in Russian).
9. P. Elias and R. A. Flower, The complexity of some simple retrieval problems, J. ACM, 22 (1975), pp. 367-379.
10. P. Erdös, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math., 51 (1985), pp. 79-89.
11. A. Fiat and M. Naor, Implicit O(1) probe search, SIAM J. Comput., 22 (1993), pp. 1-10.
12. A. Fiat, M. Naor, J. P. Schmidt, and A. Siegel, Non-oblivious hashing, J. ACM, 31 (1992), pp. 764-782.
13. G. S. Frandsen, P. B. Miltersen, and S. Skyum, Dynamic word problems, J. ACM, 44 (1997), pp. 257-271.
14. M. L. Fredman, Observations on the complexity of generating quasi-Gray codes, SIAM J. Comput., 7 (1978), pp. 134-146.
15. M. L. Fredman, The complexity of maintaining an array and computing its partial sums, J. ACM, 29 (1982), pp. 250-260.
16. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. ACM, 31 (1984), pp. 538-544.
17. Z. Füredi, On r-cover-free families, J. Combin. Theory Ser. A, 73 (1996), pp. 172-173.
18. C. T. M. Jacobs and P. van Emde Boas, Two results on tables, Inform. Process Lett., 22 (1986), pp. 43-48.
19. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, Efficient search for approximate nearest neighbor in high-dimensional spaces, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 614-623.
20. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, ACM, New York, 1998, pp. 604-613.
21. J. Katz and L. Trevisan, On the efficiency of local decoding procedures for error-correcting codes, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 80-86.
22. P. B. Miltersen, The bitprobe complexity measure revisited, in Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, Würzberg, Germany, 1993, pp. 662-671.
23. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity, J. Comput. System Sci., 57 (1998), pp. 37-49.
24. M. Minsky and S. Paper, Perceptrons, MIT Press, Cambridge, MA, 1969.
25. R. Pagh, Low redundancy in static dictionaries with O(1) worst case lookup time, in Automata, Languages, and Programming, Lecture Notes in Comput. Sci. 1644, Springer-Verlag, Berlin, 1999, pp. 595-604.
26. N. Nisan, Pseudorandom generators for space-bounded computation, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, ACM, New York, 1990, pp. 204-212.
27. N. Nisan and A. Wigderson, Hardness vs. randomness, J. Comput. System Sci., 49 (1994), pp. 149-167.
28. J. Radhakrishnan, V. Raman, and S. S. Rao, Explicit deterministic construction for membership in the bitprobe model, in Proceedings of the 9th Annual European Symposium on Algorithms, Lecture Notes in Comput. Sci. 2161, Springer-Verlag, New York, 2001, pp. 290-299.
29. M. Ruszinkó, On the upper bound of the size of r-cover-free families, J. Combin. Theory Ser. A, 66 (1984), pp. 302-310.
30. R. Raz, O. Reingold, and S. Vadhan, Extracting all the randomness and reducing the error in Trevisan's extractors, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 149-158.
31. M. Sudan, L. Trevisan, and S. Vadhan, Pseudorandom generators without the XOR lemma, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 537-546.
32. A. Ta-Shma, Explicit One-Probe Storing Schemes Using Universal Extractors, manuscript, 2001.
33. A. Ta-Shma, C. Umans, and D. Zuckerman, Loss-less condensers, unbalanced expanders, and extractors, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 143-152.
34. A. Ta-Shma and D. Zuckerman, Extractor codes, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 193-199.
35. L. Trevisan, Construction of extractors using pseudo-random generators, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 141-148.
36. A. C. Yao and F. F. Yao, Dictionary look-up with one error, J. Algorithms, 25 (1997), pp. 194-202.
37. A. C. C. Yao, Should tables be sorted?, J. ACM, 28 (1981), pp. 615-628.