@InProceedings{Riv74c,
  author = 	 { Ronald L. Rivest },
  title = 	 { On hash-coding algorithms for partial-match retrieval },
  pages = 	 { 95--103 },
  doi =          { 10.1109/SWAT.1974.17 },                  
  booktitle =    { IEEE Conference Record of 15th Annual Symposium on Switching and Automata Theory },
  publisher =    { IEEE },
  editor = 	 { Ronald Book },
  issn =         { 0272-5428 },                  
  date =         { 1974 },                  
  OPTyear = 	 { 1974 },
  OPTmonth = 	 { October 14--16, },
  eventtitle = 	 { SWAT '74 },
  eventdate =    { 1974-10-14/1974-10-16 },                  
  venue =        { New Orleans },                  
  OPTorganization = { IEEE },
  abstract =     { 
                  We examine the efficiency of generalized
                  hash-coding algorithms for performing partial-match
                  searches of a random-access file of binary words. A
                  precise characterization is given of those hash
                  functions which minimize the average number of
                  buckets examined for a search; and a new class of
                  combinatorial designs is introduced which permits
                  the construction of hash functions with worst-case
                  behavior approaching the best achievable average
                  behavior in many cases.  
                 },
}