A practical minimal perfect hashing method

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 488-500

  Botelho, Fabiano C ^a   Kohayakawa, Yoshiharu ^b   Ziviani, Nivio ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; FUNCTIONS; GRAPH THEORY; RANDOM PROCESSES;

HASH FUNCTIONS; HASHING METHOD; RANDOM GRAPHS; TIME COMPLEXITY;

ALGORITHMS;

EID: 24944474715     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_42     Document Type: Conference Paper

References (15)

1. B. Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition, 2001.
2. B. Bollobás and O. Pikhurko. Integer sets with prescribed pairwise differences being distinct. European Journal of Combinatorics. To Appear.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, second edition, 2001.
4. Z.J. Czech, G. Havas, and B.S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Information Processing Letters, 43(5):257-264, 1992.
5. Z.J. Czech, G. Havas, and B.S. Majewski. Fundamental study perfect hashing. Theoretical Computer Science, 182:1-143, 1997.
6. M. Dietzfelbinger and T. Hagerup. Simple minimal perfect hashing in less space. In The 9th European Symposium on Algorithms (ESA), volume 2161 of Lecture Notes in Computer Science, pages 109-120, 2001.
7. P. Erdos and A. Rényi. On random graphs I. Pub. Math. Debrecen, 6:290-297, 1959.
8. P. Erdo and A. Rényi. On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutat́ Int. Közl, 5:17-61, 1960.
9. E.A. Fox, Q.F. Chen, and L.S. Heath. A faster algorithm for constructing minimal perfect hash functions. In Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 266-273, 1992.
10. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, July 1984.
11. G. Havas, B.S. Majewski, N.C. Wormald, and Z.J. Czech. Graphs, hypergraphs and hashing. In 19th International Workshop on Graph-Theoretic Concepts in Computer Science, pages 153-165. Springer Lecture Notes in Computer Science vol. 790, 1993.
12. S. Janson, T. Łuczak, and A. Ruciński. Random graphs. Wiley-Inter., 2000.
13. P. Erdo and A. Rényi. On the strength of connectedness of a random graph. Acta Mathematica Scientia Hungary, 12:261-267, 1961.
14. R. Pagh. Hash and displace: Efficient evaluation of minimal perfect hash functions. In Workshop on Algorithms and Data Structures, pages 49-54, 1999.
15. B. Pittel and N. C. Wormald. Counting connected graphs inside-out. Journal of Combinatorial Theory. To Appear.