- The complexity of hashing with lazy deletion (Technical report / Brown University, Dept. of Computer Science) by Christopher J Van Wyk, 1985
- Dynamic file organizations for partial match retrieval based on linear hashing (Technical report. University of Minnesota. Institute of Technology. Computer Science Dept) by T. S Yuen, 1985
- OSU-CS-TR by George E Hedrick, 1995
- An extended study on ordered minimal perfect hashing scheme by Li-Pan Huang, 1986
- Searching on alphanumeric keys using local balanced trie hashing (Technical report. Carleton University. School of Computer Science) by Ekow J Otoo, 1987
- Cryptographic Libraries for Developers (Programming Series) by Ed Moyle, Diana Kelley, 2005-12-15
- Unique file identification in the National Software Reference Library [An article from: Digital Investigation] by S. Mead, 2006-09-01
- Accurate discovery of co-derivative documents via duplicate text detection [An article from: Information Systems] by Y. Bernstein, J. Zobel, 2006-11-01
- Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008, Proceedings (Lecture Notes in Computer Science)
- Fundamentals of Computer Security by Josef Pieprzyk, Thomas Hardjono, et all 2003-03-10
- Hello, are you human? (GIT-CC) by Jun Xu, 2001
- Load balancing and hot spot relief for hash routing among a collection of proxy caches (Research report RC. International Business Machines Corporation. Research Division) by Kun-Lung Wu, 1999
- A new method for generating minimal perfect hash functions by Thomas J Sager, 1984
- A lexical analogy to feature matching and pose estimation (SuDoc C 13.58:6790) by John Albert Horst, 2002
|