A Practical Minimal Perfect Hashing Method

We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluation of h(x) requires two memory accesses for any key x and the description of h takes

• Type: Conference
• Year: 2005
• Where: WEA
• Authors: Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Ziviani
• Keywords: Algorithms, Memory Accesses, Minimal Perfect Hash, Random Graphs, WEA 2005