A New Practical Algorithm for the Constructionof a Perfect Hash FunctionM
暂无分享，去创建一个
A perfect hash function for a subset X of {0, 1, · · · , n − 1} is an injection h from X into the set {0, 1, · · · , m − 1}. Perfect hash functions are useful for the compact storage and fast retrieval of frequently used objects. In this paper, we discuss some new practical algorithms for efficient construction of perfect hash functions, and we analyze their complexity and program size.
[1] Kurt Mehlhorn,et al. Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.
[2] C. Colbourn,et al. The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.
[3] Douglas R Stinson,et al. Some recursive constructions for perfect hash families , 1996 .
[4] George Havas,et al. Perfect Hashing , 1997, Theor. Comput. Sci..