On risks of using cuckoo hashing with simple universal hash classes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 795-804

  Dietzfelbinger, Martin ^a   Schellbach, Ulf ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

HASH FUNCTIONS;

COLLISION PROBABILITY; DYNAMIC DICTIONARIES; FAILURE PROBABILITY; LINEAR HASH FUNCTION; LOOKUP TIME; MAXIMUM PROBABILITY; PRIME FIELD; UNIVERSAL HASH;

PROBABILITY;

EID: 70349087725     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.87     Document Type: Conference Paper

References (13)

1. L. Carter and M. N. Wegman, Universal Classes of Hash Functions, J. Comput. Syst. Sci., 18 (1979), pp. 143-154.
2. K. Mehlhorn, Data Structures and Algorithms, vol.1, Springer-Verlag, Berlin, 1984.
3. M. Mitzenmacher and E. Upfal, Probability and Computing, Cambridge University Press, Cambridge, UK, 2005.
4. B. Chor and O. Goldreich, Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity, SIAM J. Comput., 17 (1988), pp. 230-261.
5. D. Zuckerman, Simulating BPP Using a General Weak Random Source, Algorithmica, 16 (1996), pp. 367-391. (Pubitemid 126416932)
6. M. Dietzfelbinger, T. Hagerup, J. Katajainen, and M. Penttonen, A Reliable Randomized Algorithm for the Closest-Pair Problem, J. Algorithms, 25 (1997), pp. 19-51. (Pubitemid 127451249)
7. [7| R. Pagh and F. F. Rodler, Cuckoo Hashing, in Proc. ESA 2001, LNCS 2161, Springer, 2001, pp. 121-133.
8. R. Pagh, On the Cell Probe Complexity of Membership and Perfect Hashing in Proc. 33rd Annual Symp. on Theory of Computing, ACM Press, 2001, pp. 425-432.
9. L. Devroye and P. Morin, Cuckoo Hashing: Further Analysis, Inf. Process. Lett., 86 (2003), pp. 215-219.
10. R. Pagh and F. F. Rodler, Cuckoo Hashing, J. Algorithms, 51 (2004), pp. 122-144.
11. A. Pagh, R. Pagh, and M. Ružić, Linear Probing with Constant Independence, in Proc. 39th Annual ACM Symp. on Theory of Computing, ACM Press, 2007, pp. 318-327.
12. M. Mitzenmacher and S. Vadhan, Why Simple Hash Functions Work: Exploiting the Entropy in a Data Stream, in Proc. 19th Annual ACM-SIAM Symp. on Discrete Algorithms, SIAM, 2008, pp. 746-755.
13. J. Cohen and D. M. Kane, 6.856 Project: Bounds on the Independence Required for Cuckoo Hashing, http://web.mit.edu/dankane/www/ Independence%20Bounds.pdf.