Are bitvectors optimal?

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 449-458

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

^a CWI   (Netherlands)

^b AARHUS UNIVERSITY   (Denmark)

^c TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BITVECTORS; ERROR PROBABILITIES; INFORMATION-THEORETIC LOWER BOUNDS; LOWER BOUNDS; MEMBERSHIP PROBLEM; PROBABILITY OF ERRORS; UPPER AND LOWER BOUNDS; UPPER BOUND;

COMPUTATION THEORY; INFORMATION THEORY; ERRORS; PROBABILITY; SET THEORY;

QUERY PROCESSING; MEMBERSHIP FUNCTIONS;

STATIC MEMBERSHIP PROBLEM;

EID: 0033701727     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335357     Document Type: Conference Paper

References (27)

1. B. Bollobás, Random Graphs, Academic Press, 1985.
2. L. Babai, L. Fortnow, L.A. Levin, M. Szegedy, Checking computations in polylogarithmic time, Proceedings of STOC'91, pages 21-31.
3. A. Brodnik and J.I. Munro, Membership in constant time and minimum space, Lecture Notes In Computer Science, 855:72-81, 1994.
4. V. Chvátal, The tail of hypergeometric distribution, Discrete Mathematics, 25.285-287, 1979.
5. S. Chaudhuri and J. Radhakrishnan, Deterministic restrictions in circuit complexity, Proceedings of STOC'96, 30-36.
6. A.G. Dyachkov and V.V. Rykov, Bounds on the length of disjunctive codes, Problemy Peredachi Informatsii,18, No.3(1982), 7-13 [Russian].
7. P. Elias and R. A. Flower, The complexity of some simple retrieval problems, Journal of the Association for Computing Machinery, 22:367-379, 1975.
8. P. Erdo{combining double acute accent}s, P. Frankl, and Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel Journal of Mathematics, 51:79-89, 1985.
9. A. Fiat and M. Noar, Implicit O(1) probe search, SIAM Journal of Computing, 22:1-10, 1993.
10. A. Fiat, M. Noar, J.P. Schmidt and A. Siegel, Non-oblivious hashing, Journal of the Association of Computing Machinery, 31:764-782, 1992.
11. G.S. Frandsen, P.B. Miltersen, and S. Skyum, Dynamic word problems, Journal of the Association of Computing Machinery, 44:257-271, 1997. (Pubitemid 127628547)
12. M.L. Predman, Observations on the complexity of generating quasi-Gray codes, SIAM Journal of Computing, 7:134-146, 1978.
13. M.L. Fredman, The Complexity of Maintaining an Array and Computing its Partial Sums, Journal of Association of Computing Machinery, 29:250-260, 1982.
14. M. L. Fredman, J. Komlós, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, Journal of the Association for Computing Machinery, 31 (3):538-544, 1984.
15. Z. Füredi, On r-cover-free families, Journal of Combinatorial Theory, Series A, 73:172-173, 1996.
16. C.T.M. Jacobs and P. van Emde Boas, Two results on tables, Information Processing Letters, 22:43-48, 1986.
17. E. Kushilevitz, R. Ostrovsky, Y. Rabani, Efficient search for approximate nearest neighbor in high-dimensional spaces, Proceedings of STOC'98, pages 614-623.
18. P. Indyk, R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, Proceedings of STOC'98, pages 604-613.
19. P.B. Miltersen, The bitprobe complexity measure revisited, In Proceedings of STACS'93, 662-671.
20. P.B. Miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity, Journal of Computer and System Sciences, 57:37-49, 1998. (Pubitemid 128428156)
21. M. Minsky and S. Papert, Perceptrons. MIT Press, Cambridge, Mass., 1969.
22. R. Pagh, Low redundancy in static dictionaries with O(1) lookup time, Proceedings of ICALP'99, LNCS 1644, pages 595-604.
23. N. Nisan, Pseudorandom generators for space-bounded computation, Proceedings of STOC'90, 204-212.
24. N. Nisan and A. Wigderson, Hardness vs randomness, Journal of Computer and System Sciences, 49:149-167, 1994. (Pubitemid 124013312)
25. M. Ruszinkó, On the upper bound of the size of r-cover-free families, Journal of Combinatorial Theory, Series A, 66:302-310, 1994.
26. A. C. Yao and F. F. Yao, Dictionary look-up with one error, Journal of Algorithms, 25(1):194-202, 1997.
27. A. C. C. Yao, Should tables be sorted?, Journal of the Association of Computing Machinery, 28(3):615-628, 1981.