Bibliography
Bradford, Philip G., and Michael N. Katehakis. 2007. “A Probabilistic Study on Combinatorial Expanders and Hashing.”
SIAM J. Comput.
317 (1):83–111.
Carter, J. Lawrence, and Mark N. Wegman. 1979. “Universal Classes of Hash Functions.”
Journal of Computer and System Sciences
18 (2):143–54.
Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009.
Introduction to Algorithms, Third Edition
. 3rd ed. The MIT Press.
Dietzfelbinger, Martin, Torben Hagerup, Jyrki Katajainen, and Martti Penttonen. 1997. “A Reliable Randomized Algorithm for the Closest-Pair Problem.”
Journal of Algorithms
25 (1):19–51.
Litwin, Withold. 1980. “Linear Hashing: a new tool for file and table addressing.” In
Conference on Very Large ...