Show simple item record

dc.contributor.authorKarplus, Kevinen_US
dc.contributor.authorHaggard, Garyen_US
dc.date.accessioned2007-04-23T16:53:17Z
dc.date.available2007-04-23T16:53:17Z
dc.date.issued1984-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-637en_US
dc.identifier.urihttps://hdl.handle.net/1813/6476
dc.description.abstractA heuristic is given for finding minimal perfect hash functions without extensive searching. 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 relies on a backtracking algorithm for numbering the vertices of the graph. Careful selection of the graph model limits the time spent searching. Good results have been obtained for dictionaries of up to 181 words. Using the same techniques, non-minimal perfect hash functions have been found for sets of up to 667 words.en_US
dc.format.extent2814158 bytes
dc.format.extent1199234 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleFinding Minimal Perfect Hash Functionsen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics