perfect hash functions for large dictionaries
We describe a new practical algorithm for finding perfect hash functions with no specification space at all , suitable for key sets ranging in size from small to very large. The method is able to find perfect hash functions for various sizes of key sets in linear time. The perfect hash functions produced are optimal in terms of time (perfect) and require at most computation of h 1 ( k ) and h 2 ( k ); two simple auxiliary pseudorandom functions.
perfect hashing mos indexing acyclic random graphs