| 
|
QuoteRef: jenkB9_1997
topics >
all references >
ThesaHelp:
references i-l
Topic:
hash table and hash functions
Reference
Jenkins, B., "Hash functions", Dr. Dobb's Journal, 22, 9, pp. 107-9, 115-16, September 1997. Google
Notes
http://ourworld.compuserve.com/homepages/bob_jenkins/blockcip.htm
107 ;;Quote: a hash function should avoid funneling, i.e., the map of a set of input bits to a smaller set of output bits
107+;;Quote: the fastest code for a hash function to mix three 32-bit values reversibly
108 ;;Quote: a hash function should be reversible, i.e., a permutation; otherwise it loses information about earlier blocks
ThesaHelp: references i-l (342 items)
Topic: hash table and hash functions (41 items)