Hash and displace: Efficient evaluation of minimal perfect hash functions

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

Volumn 1663, Issue , 1999, Pages 49-54

  Pagh, Rasmus ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; HASH FUNCTIONS; PROBES;

MINIMAL PERFECT HASHES; MINIMAL PERFECT HASHING;

FUNCTION EVALUATION;

EID: 84948981268     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48447-7_5     Document Type: Conference Paper

References (10)

1. Arne Andersson, Peter Bro Miltersen, Søren Riis, and Mikkel Thorup. Static dictionaries on AC0 RAMs: query time θ is necessary and sufficient. In Proceedings of 37th Annual Symposium on Foundations of Computer Science, pages 441-450. IEEE Comput. Soc. Press, Los Alamitos, CA, 1996.
2. J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. J. Comput. System Sci., 18(2):143-154, 1979.
3. Zbigniew J. Czech, George Havas, and Bohdan S. Majewski. Perfect hashing. Theoretical Computer Science, 182(1-2): 1-143, 15 August 1997.
4. Martin Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In STACS 96 (Grenoble, 1996), pages 569-580. Springer, Berlin, 1996.
5. Martin Dietzfelbinger and Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In Automata, languages and programming (Coventry, 1990), pages 6-19. Springer, New York, 1990.
6. Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, and Amjad M. Daoud. Practical minimal perfect hash functions for large databases. Communications of the ACM, 35(1):105-121, January 1992.
7. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with 0(1) worst case access time. J. Assoc. Comput. Mach., 31(3):538-544, 1984.
8. Kurt Mehlhorn. Data structures and algorithms. 1. Springer-Verlag, Berlin, 1984. Sorting and searching.
9. Rasmus Pagh. Hash and displace: Efficient evaluation of minimal perfect hash functions. Research Series RS-99-13, BRICS, Department of Computer Science, University of Aarhus, May 1999.
10. Robert Endre Tarjan and Andrew Chi Chih Yao. Storing a sparse table. Communications of the ACM, 22(11):606-611, November 1979.