论文信息 - An Interactive System for Finding Perfect Hash Functions

An Interactive System for Finding Perfect Hash Functions

The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.

Nick Cercone | Max Krause | John Boates

[1] John A. Allen,et al. The anatomy of lisp , 1980 .

[2] Robert H. Morris,et al. Scatter storage techniques , 1983, CACM.

[3] Renzo Sprugnoli,et al. Perfect hashing functions , 1977, Commun. ACM.

[4] Richard J. Cichelli. Minimal perfect hash functions made simple , 1980, CACM.

[5] Nick Cercone,et al. Minimal and almost minimal perfect hash function search with application to natural language lexicon design , 1983 .

[6] D. Knuth. Estimating the efficiency of backtrack programs. , 1974 .

[7] Gerhard Jaeschke. Reciprocal hashing: a method for generating minimal perfect hashing functions , 1981, CACM.