Some open questions related to cuckoo hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5757 LNCS, Issue , 2009, Pages 1-10

  Mitzenmacher, Michael ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPEN PROBLEMS;

EID: 70350423055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_1     Document Type: Conference Paper

References (38)

1. Adler, M., Chakrabarti, S., Mitzenmacher, M., Rasmussen, L.: Parallel randomized load balancing. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 238-247 (1995)
2. Alcantara, D., Sharf, A., Abbasinejad, F., Amenta, N., Mitzenmacher, M., Owens, J., Sengupta, S.: Real-time parallel hashing on the GPU (submitted)
3. Arbitman, Y., Naor, M., Segev, G.: De-amortized cuckoo hashing: provable worstcase performance and experimental results. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part I. LNCS, vol. 5555, pp. 107-118. Springer, Heidelberg (2009)
4. Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal of Computing 29(1), 180-200 (1999)
5. Batu, T., Berenbrink, P., Cooper, C.: Balanced allocations: Balls-into-bins revisited and chains-into-bins. CDAM Research Report LSE-CDAM-2007-34
6. Braverman, M.: Poly-logarithmic independence fools AC0 circuits. To appear in Proceedings of the 24th Annual IEEE Conference on Computational Complexity (2009)
7. Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve IP Lookups. In: Proceedings of IEEE INFOCOM, pp. 1454-1463 (2001)
8. Cain, J., Sanders, P., Wormald, N.: The random graph threshold for k-orientability and a fast algorithm for optimal multiple-choice allocation. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 469-476 (2007)
9. Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18(2), 143-154 (1979)
10. Chung, K.M., Vadhan, S.: Tight bounds for hashing block sources. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 357-370. Springer, Heidelberg (2008)
11. Cohen, J., Kane, D.: Bounds on the independence required for cuckoo hashing (preprint)
12. Dalal, K., Devroye, L., Malalla, E., McLeish, E.: Two-way chaining with reassignment. SIAM Journal on Computing 35, 327-340 (2006)
13. Dietzfelbinger, M., Meyer auf der Heide, F.: An optimal parallel dictionary. Information and Computation 102(2), 196-217 (1993)
14. Dietzfelbinger, M., Meyer auf der Heide, F.: Simple, efficient shared memory simulations. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 110-119 (1993)
15. Dietzfelbinger, M., Pagh, R.: Succinct data structures for retrieval and approximate membership (Extended abstract). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 385-396. Springer, Heidelberg (2008)
16. Dietzfelbinger, M., Schellbach, U.: On risks of using cuckoo hashing with simple universal hash classes. In: Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 795-804 (2009)
17. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoretical Computer Science 380(1-2), 47-68 (2007)
18. Fernholz, D., Ramachandran, V.: The k-orientability thresholds for Gn,p. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 459-468 (2007)
19. Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space efficient hash tables with worst case constant access time. Theory of Computing Systems 38(2), 229-248 (2005)
20. Fredman, M., Komlós, J., Szemerédi, E.: Stoaring a sparse table with O(1) worst case access time. Journal of the Association of Computing Machinery 31(3), 538- 544 (1984)
21. Frieze, A., Melsted, P., Mitzenmacher, M.: An analysis of random-walk cuckoo hashing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009 and RANDOM 2009. LNCS, vol. 5687, pp. 490-503. Springer, Heidelberg (2009)
22. Gonnet, G.: Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery 28(2), 289-304 (1981)
23. Karp, R., Luby, M., Meyer, F., Meyer auf der Heide, F.: Efficient PRAM simulation on a distributed memory machine. Algorithmica 16(4), 517-542 (1996)
24. Kirsch, A., Mitzenmacher, M.: Using a queue to de-amortize cuckoo hashing in hardware. In: Proceedings of the Forty-Fifth Annual Allerton Conference on Communication, Control, and Computing (2007)
25. Kirsch, A., Mitzenmacher, M.: The power of one move: hashing schemes for hardware. In: Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), pp. 106-110 (2008)
26. Kirsch, A., Mitzenmacher, M., Wieder, U.: More robust hashing: Cuckoo hashing with a stash. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 611-622. Springer, Heidelberg (2008)
27. Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-based techniques for high-speed packet processing. Preprint, to appear in Algorithms for Next Generation Networks. Springer, Heidelberg (2009)
28. Knuth, D.: The Art of Computer Programming, Sorting and Searching, vol. 3. Addison-Wesley, Reading (1973)
29. Kutzelnigg, R.: Bipartite random graphs and cuckoo hashing. In: Proceedings of the Fourth Colloquium on Mathematics and Computer Science (2006)
30. Mitzenmacher, M., Richa, A., Sitaraman, R.: The power of two choices: a survey of techniques and results. In: Pardalos, P., Rajasekaran, S., Reif, J., Rolim, J. (eds.) Handbook of Randomized Computing, pp. 255-312. Kluwer Academic Publishers, Norwell (2001)
31. MacKenzie, P., Plaxton, C.G., Rajaraman, R.: On contention resolution protocols and associated probabilistic phenomena. Journal of the ACM 45(2), 324-378 (1998)
32. Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: exploiting the entropy in a data stream. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 746-755 (2008)
33. Naor, M., Segev, G., Wieder, U.: History-Independent Cuckoo Hashing. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A.,Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol. 5126, pp. 631-642. Springer, Heidelberg (2008)
34. Pagh, A., Rodler, F.: Cuckoo hashing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 121-133. Springer, Heidelberg (2001)
35. Pagh, A., Rodler, F.: Cuckoo hashing. Journal of Algorithms 51(2), 122-144 (2004)
36. Porat, E.: An optimal Bloom filter replacement based on matrix solving. Technical report, arxiv:0804.1845v1 [cs.DS] (April 2008)
37. Siegel, A.: On universal classes of fast high performance hash functions, their timespace tradeoff, and their applications. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 20-25 (1989)
38. Vöcking, B.: How asymmetry helps load balancing. Journal of the ACM 50(4), 568-589 (2003)