Design strategies for minimal perfect hash functions

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

Volumn 4665 LNCS, Issue , 2007, Pages 2-17

  Dietzfelbinger, Martin ^a  

^a ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

NUMERICAL METHODS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPLEXITY MEASURES;

SET THEORY;

EID: 38149103477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74871-7_2     Document Type: Conference Paper

References (32)

1. Bast, H., Mehlhorn, K., Schäfer, G., Tamaki, H.: Matching algorithms are fast in sparse random graphs. Theory Comput. Syst. 39(1), 3-14 (2006)
2. Bentley, J.: Programming pearls: a sample of brilliance. J. Assoc. Comput. Mach. 30(9), 754-757 (1987)
3. Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422-426 (1970)
4. Botelho, F.C., Kohayakawa, Y., Ziviani, N.: A practical minimal perfect hashing method. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 488-500. Springer, Heidelberg (2005)
5. Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Proc. 10th Workshop on Algorithms and Data Structures (WADS 2007). LNCS, vol. 4619, Springer, Heidelberg (to appear 2007)
6. Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143-154 (1979)
7. Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The Bloomier filter: an efficient data structure for static support lookup tables. In: Proc. 15th ACM-SIAM SODA 2004, pp. 30-39 (2004)
8. Czech, Z.J., Havas, G., Majewski, B.S.: An optimal algorithm for generating minimal perfect hash functions. Inform. Proc. Lett. 43(5), 257-264 (1992)
9. Czech, Z.J., Havas, G., Majewski, B.S.: Perfect Hashing (Fundamental Study). Theor. Comput. Sci. 182(1-2), 1-143 (1997)
10. Demaine, E.D., Meyer auf der Heide, F., Pagh, R., Patrascu, M.: De dictionariis dynamicis pauco spatio utentibus (lat. On dynamic dictionaries using little space). In: Correa, J.R., Hevia, A., Kiwi, M.A. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 349-361. Springer, Heidelberg (2006)
11. Dietzel, L.: Speicherplatzeffiziente perfekte Hashfunktionen, Diplomarbeit, Technische Universität Ilmenau, Fakultät IA (in German) (2005)
12. Dietzfelbinger, M., Gil, J., Matias, Y., Pippenger, N.: Polynomial hash functions are reliable. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol. 623, pp. 235-246. Springer, Heidelberg (1992)
13. Dietzfelbinger, M., Hagerup, T.: Simple minimal perfect hashing in less space. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 109-120. Springer, Heidelberg (2001)
14. Dietzfelbinger, M., Meyer auf der Heide, F.: Dynamic hashing in real time. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol. 443, pp. 6-19. Springer, Heidelberg (1990)
15. Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., Tarjan, R.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23(4), 738-761 (1994)
16. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theoret. Comput. Sci. 380(1-2), 47-68 (2007)
17. Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space efficient hash tables with worst case constant access time. Theory Comput. Syst. 38(2), 229-248 (2005)
18. Fredman, M.L., Komlós, J.: On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Disc. Meth. 5(1), 61-68 (1984)
19. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with 0(1) worst case access time. J. Assoc. Comput. Mach. 31(3), 538-544 (1984)
20. Hagerup, T., Tholey, T.: Efficient minimal perfect hashing in nearly minimal space, in: Proc. 18th STACS 2001, Springer LNCS 2010. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 317-326. Springer, Heidelberg (2001)
21. Knuth, D.E.: The Art of Computer Programming, vol. 2: Seminumerical Algorithms, 2nd edn. Addison-Wesley, Reading (1981)
22. Majewski, B.S., Wormald, N.C., Havas, G., Czech, Z.J.: A family of perfect hashing methods. Computer J. 39(6), 547-554 (1996)
23. Mehlhorn, K.: Data Structures and Algorithms, Vol. 1: Sorting and Searching. Springer, Berlin (1984)
24. Motwani, R.: Average-case analysis of algorithms for matchings and related problems. J. Assoc. Comput. Mach. 41(6), 1329-1356 (1994)
25. Pagh, R.: Hash and displace: Efficient evaluation of minimal perfect hash functions. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 49-54. Springer, Heidelberg (1999)
26. Pittel, B., Wormald, N.C.: Counting connected graphs inside-out. J. Comb. Theory, Ser. B 93(2), 127-172 (2005)
27. Sanders, P.: personal communication
28. Schmidt, J.P., Siegel, A.: The spatial complexity of oblivious k-probe hash functions. SIAM J. Comput. 19(5), 775-786 (1990)
29. Siegel, A.: On universal classes of extremely random constant-time hash functions. SIAM J. Comput. 33(3), 505-543 (2004)
30. Thorup, M.: Even strongly universal hashing is pretty fast. In: Proc. 11th ACM-SIAM SODA 2000, pp. 496-497 (2000)
31. Weidling, C.: Platzeffiziente Hashverfahren mit garantierter konstanter Zugriffszeit, Dissertation. Technische Universität Ilmenau (in German) Electronic version. (2004), http://www.db-thueringen.de/servlets/ DocumentServlet7id-2431
32. Woelfel, P.: Maintaining external memory efficient hash tables. In: Diaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 508-519. Springer, Heidelberg (2006)