On the expected longest length probe sequence for hashing with separate chaining
暂无分享,去创建一个
[1] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .
[2] M. V. Ramakrishna. An exact probability model for finite hash tables , 1988, Proceedings. Fourth International Conference on Data Engineering.
[3] Hyesook Lim,et al. High speed IP address lookup architecture using hashing , 2003, IEEE Communications Letters.
[4] Edward A. Fox,et al. Practical minimal perfect hash functions for large databases , 1992, CACM.
[5] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[6] Per-Åke Larson. Expected Worst-Case Performance of Hash Files , 1982, Comput. J..
[7] Gaston H. Gonnet,et al. Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.
[8] Timothy J. Purcell. Sorting and searching , 2005, SIGGRAPH Courses.
[9] Koen De Bosschere,et al. XOR-based hash functions , 2005, IEEE Transactions on Computers.
[10] M. V. Ramakrishna,et al. Hashing practice: analysis of hashing and universal hashing , 1988, SIGMOD '88.
[11] Donald E. Knuth. Art of Computer Programming, Volumes 1-4A Boxed Set , 2011 .