Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!watmath!clyde!ima!johnl
From: johnl@ima.UUCP
Newsgroups: mod.compilers
Subject: Looking for minimal perfect hash functions.
Message-ID: <526@sargas.usc.edu>
Date: Sun, 25-Jan-87 05:30:37 EST
Article-I.D.: sargas.526
Posted: Sun Jan 25 05:30:37 1987
Date-Received: Mon, 26-Jan-87 01:57:05 EST
Sender: johnl@ima.UUCP
Reply-To: tli@pollux.usc.edu.UUCP (Tony Li)
Organization: University of Southern California, Los Angeles
Lines: 19
Keywords: hashing reserved words
Approved: compilers@ima.UUCP

Hi,

Has anyone implemented a program for finding minimal perfect hashing
functions?  The best reference that I have for them is CACM May '85 "A
Polynomial Time Generator for Minimal Perfect Hash Functions".  The
algorithm is somewhat lengthy (and messy) so I would really not like
to have to re-invent the wheel.  If you have such a beastie, could you
please send me a copy?  Thanks.  And maybe mod.sources would like a
copy too.

Thanks in advance,
Tony ;-)
[I haven't seen anything since then, but as always encourage submissions
from readers. -John]
--
Send compilers articles to ima!compilers or, in a pinch, to Levine@YALE.EDU
Plausible paths are { ihnp4 | decvax | cbosgd | harvard | yale | cca}!ima
Please send responses to the originator of the message -- I cannot forward
mail accidentally sent back to compilers.  Meta-mail to ima!compilers-request