johnl@ima.UUCP (01/26/87)
Readers may be interested in my article "Practical Perfect Hashing" in
Computer Journal 28 (1985).
Gordon V. Cormack CS Dept, University of Waterloo, Canada N2L 3G1
gvcormack@mum.waterloo { .CSNET or .CDN }
gvcormack@water { UUCP or BITNET }
--
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-requestjohnl@ima.UUCP (01/30/87)
In the compilers (and like programs) that I've done,
I've found that I don't care if the hash function is
minimal or not, as long as it's perfect and ``small enough'',
that is, I don't care if my array is 61 words long or 59.
Therefore, I recently wrote a perfect-hash-function-finder
in Metafont (yes, Metafont). It's very slow, but, on the
other hand, I also don't care if it takes a few hours to
find something good, since I don't write compilers very
often.
If anyone (sorry, I forgot the name of the person who wanted this)
cares about this at all, send me mail.
Karl kbb%cs.brown.edu@csnet-relay
{decvax,ihnp4,...}!brunix!kbb
--
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