FINDING MINIMAL PERFECT HASH FUNCTIONSGary Haggard
Department of Computer ScienceUniversity of Maine at Orono
andKevin Karplus
Department of Computer ScienceCornell UniversityABSTRACTA heurisitic 4s given for ft;ftie
minimal perfect hash functions .
extensive searchings The procedure is to
construct a set of graph (or hypergraph)
models for the dictionary, then choose one
of the models for use in constructing the
minimal perfect hashing function. The
construction of this function relie
