Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!rutgers!seismo!rochester!cornell!batcomputer!garry
From: garry@batcomputer.UUCP
Newsgroups: net.sources
Subject: Re: Looking for Minimal Perfect Hash Functions [Here's a C Program]
Message-ID: <235@batcomputer.tn.cornell.edu>
Date: Sat, 21-Feb-87 01:12:37 EST
Article-I.D.: batcompu.235
Posted: Sat Feb 21 01:12:37 1987
Date-Received: Fri, 27-Feb-87 00:43:30 EST
Reply-To: garry%oak.cadif.cornell.edu@cu-arpa.cs.cornell.edu
Organization: Cornell Engineering && Flying Moose Graphics
Lines: 17

In a recent article michael@orcisi.UUCP wrote:
>Here is a C program that will compute approximate perfect hashing functions.
>I received it through net.sources in Sept. 1984.
>
>...  based on "More on Minimal
>Perfect Hash Tables," Colorado State University Technical Report,
>April 1981, by Cook, Curtis R. and Oldehoeft, R. R., and "Minimal
>Perfect Hash Functions Made Simple" by Richard J. Cichelli - Comm.
>of ACM Jan 1980.

The posted program unfortunately does not have the property of being minimal.
(Did the 1984 version??)

Does anyone out there have a *minimal* perfect hashing function generator,
per the ACM article?

garry wiegand   (garry%oak.cadif.cornell.edu@cu-arpa.cs.cornell.edu)