- Hash tables in PRAM and VLSI models (Technical report / Dipartimento di informatica, Università di Pisa) by Fabrizio Luccio,  1989
 - Parallel access to hash tables (Technical report / Dipartimento di informatica, Università di Pisa) by Fabrizio Luccio,  1989
 - A new method for generating minimal perfect hash functions by Thomas J Sager,  1984
 - Rationale for bit fixing in the MDC-2 algorithm (Research report RC. International Business Machines Corporation. Research Division) by Don Coppersmith,  1999
 - Application of finite fields to memory interleaving (HP Laboratories technical report) by Abraham Lempel,  1992
 - 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
 - On-the-fly compression of logical circuits (Research report RC. International Business Machines Corporation. Research Division) by Malay K Ganai,  2000
 - An O(n log n) algorithm for finding minimal perfect hash functions (TR) by E. A Fox,  1989
 - Hello, are you human? (GIT-CC) by Jun Xu,  2001
 - LEND and faster algorithms for constructing minimal perfect hash functions by E. A Fox,  1992
 - The correctness proof of a quadratic-hash algorithm by A. Nico Habermann,  1975
 - A composition theorem for universal one-way hash functions (Research report / International Business Machines Corporation. Research Division) by Victor Shoup,  1999
 - Implementation of a perfect hash function scheme (TR) by Sanjeev Datta,  1989
 - Un algorithme parallele de fermeture transitive utilisant un placement par hachage =: A parallel transitive closure algorithm using hash-based clustering ... Recherche en Informatique et en Automatique) by Jean-Pierre Cheiney,  1988
   |