The power of simple tabulation Hashing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 1-10

  Pǎtraşcu, Mihai ^a   Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

concentration bounds; cuckoo hashing; independence; linear probing; minwise independence; tabulation hashing

Indexed keywords

COMPUTATION THEORY; HASH FUNCTIONS;

CONCENTRATION BOUNDS; CUCKOO HASHING; INDEPENDENCE; LINEAR PROBING; MINWISE INDEPENDENCE; TABULATION HASHING;

C (PROGRAMMING LANGUAGE);

EID: 79959686848     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993638     Document Type: Conference Paper

References (31)

1. V. Braverman, K.-M. Chung, Z. Liu, M. Mitzenmacher, and R. Ostrovsky. AMS without 4-wise independence on product domains. In STACS'10, pages 119-130.
2. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comp. Sys. Sci., 18(2):143-154, 1979.
3. See also STOC'77.
4. J. S. Cohen and D. M. Kane. Bounds on the independence required for cuckoo hashing. Manuscript, 2009.
5. M. Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In STACS'96, pages 569-580.
6. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen. A reliable randomized algorithm for the closest-pair problem. J. Alg., 25(1):19-51, 1997.
7. M. Dietzfelbinger and M. Rink. Applications of a splitting trick. In ICALP'09, pages 354-365.
8. M. Dietzfelbinger and U. Schellbach. On risks of using cuckoo hashing with simple universal hash classes. In SODA'09, pages 795-804.
9. M. Dietzfelbinger and P. Woelfel. Almost random graphs with simple hash functions. In STOC'03, pp. 629-638.
10. L. Gerber. An extension of Bernoulli's inequality. Amer. Math. Monthly, 75:875-876, 1968.
11. P. Indyk. A small approximately min-wise independent family of hash functions. J. Alg., 38(1):84-90, 2001.
12. See also SODA'99.
13. H. J. Karlo and P. Raghavan. Randomized algorithms and pseudorandom numbers. JACM, 40(3):454-476, 1993.
14. D. E. Knuth. Notes on open addressing. Unpublished memorandum, 1963.
15. M. Mitzenmacher and S. P. Vadhan. Why simple hash functions work: exploiting the entropy in a data stream. In SODA'08, pp. 746-755.
16. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
17. A. Pagh, R. Pagh, and M. Ružic. Linear probing with constant independence. SIAM J. Comp., 39(3):1107-1120, 2009.
18. See also STOC'07.
19. R. Pagh and F. F. Rodler. Cuckoo hashing. J. Alg., 51(2):122-144, 2004.
20. See also ESA'01.
21. M. Pǎtraşcu and M. Thorup. On the k-independence required by linear probing and minwise independence. In ICALP'10, pages 715-726.
22. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223-250, 1995.
23. See also SODA'93.
24. A. Siegel. On universal classes of extremely random constant-time hash functions. SIAM J. Comp., 33(3):505-543, 2004.
25. See also FOCS'89.
26. M. Thorup. Even strongly universal hashing is pretty fast. In SODA'00, pages 496-497.
27. M. Thorup. String hashing for linear probing. In SODA'09, pages 655-664.
28. M. Thorup and Y. Zhang. Tabulation based 4-universal hashing with applications to second moment estimation. In SODA'04, pages 615-624.
29. M. Thorup and Y. Zhang. Tabulation based 5-universal hashing and linear probing. In ALENEX'09.
30. M. N. Wegman and L. Carter. New classes and applications of hash functions. J. Comp. Sys. Sci., 22(3):265-279, 1981.
31. See also FOCS'79.