BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-75-511
       ENTRY:: August 23, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Software implementation of a new method of combinatorial
               hashing.
        TYPE:: Technical Report
      AUTHOR:: Dubost, Pierre
      AUTHOR:: Trousse, Jean-Michel
        DATE:: September 1975
       PAGES:: 36
    ABSTRACT:: This is a study of the software implementation of a new
               method of searching with retrieval on secondary keys.

               A new family of partial match file designs is presented, the
               'worst case' is determined, a detailed algorithm and program
               are given and the average execution time is studied.
       NOTES:: [Adminitrivia V1/Prg/19950823]
         END:: STAN//CS-TR-75-511