Re: Generating hash tables from known input

gbcacm@flora.ccs.northeastern.edu (Greater Boston Chapter of the ACM)
Mon, 17 May 1993 14:57:48 GMT

          From comp.compilers
Related articles
Generating hash tables from known input (I think) rv@erix.ericsson.se (1993-05-10)
Re: Generating hash tables from known input gbcacm@flora.ccs.northeastern.edu (1993-05-17)
Re: Generating hash tables from known input (bibliography) oz@ursa.sis.yorku.ca (1993-05-21)
| List of all articles for this month |
Newsgroups: comp.compilers
From: gbcacm@flora.ccs.northeastern.edu (Greater Boston Chapter of the ACM)
Keywords: analysis
Organization: College of CS, Northeastern U
References: 93-05-049
Date: Mon, 17 May 1993 14:57:48 GMT

"Minimal Perfect Hash Functions Made Simple", by Richard J. Cichelli,
CACM 23 #1 17-19 (1980) describes a method for creating perfect hash
functions from character strings of the form


          hash value <- key length + key 1st char + key last char
--
Peter Sherwood
(617) 332-8880 (voice)
(617) 332-1675 (fax)
gbcacm@damon.ccs.northeastern.edu
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.