Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!think.com!mintaka!spdcc!iecc!compilers-sender
From: brain@eos.ncsu.edu (Marshall Brain)
Newsgroups: comp.compilers
Subject: Re: Hash specifics
Keywords: design
Message-ID: <1990Dec18.215149.980@ncsuvx.ncsu.edu>
Date: 18 Dec 90 21:51:49 GMT
References: <9012111913.AA07310@cs-sun-fsa.cpsc.ucalgary.ca>
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: brain@eos.ncsu.edu (Marshall Brain)
Organization: North Carolina State University
Lines: 15
Approved: compilers@iecc.cambridge.ma.us

Cichelli's work in Perfect Hashing was extended in the paper:

	"Near-Perfect Hashing of Large Word Sets", by Brain and Tharp,
	Software - Practice and Experience, Vol. 19, No. 10 (October 1989)
	pp. 967-978.

This algorithm could handle around 1000 words. An extremely simple algorithm,
also based on Cichelli's work and able to handle up to 5000 or so words 
appeared in the paper:

	"Perfect Hashing Using Sparse Matrix Packing", by Brain and Tharp,
	Information Systems, Vol. 15, No. 3 (1990), pp. 281-290.
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.