8726 Ross Anderson/Eli Biham: Tiger - a new fast hash function. Internet 1996, 12p. 7587 M. Atici/S. Magliveras/Douglas Stinson/W.D. Wei: Some recursive constructions for perfect hash families. Internet 1995, 17p. 8719 Alberto Bassi/Luca Bompani/Gabriele Cavestro/Elisa Fornasini: Linear hashing e varianti. Internet, ca. 1994, 18p. J. Bell/C. Kaman: The linear quotient hash code. Comm. ACM 13 (1970), 675-677. 8727 Ju''rgen Bierbrauer: Universal hashing and geometric codes. Internet 1994, 18p. 8677 Ju''rgen Bierbrauer: A^2-codes from universal hash codes. Internet, ca. 1995, 10p. 7658 Andrew Binstock: Hashing rehashed. Dr Dobbs' Journal April 1996, 24-33. R. Brent: Reducing the retrieval time of scatter storage techniques. Comm. ACM 16 (1973), 105-109. J. Carter/M. Wegman: Universal classes of hash functions. J. Computer and System Sciences 18 (1979), 143-154. P. Celis: Robin Hood hashing. Dissertation Waterloo 1986 (Technical Report CS-86-14). P. Celis/P. Larson/J. Munro: Robin Hood hashing. In Symposium on Foundations of Computer Science (Computer Society Press of IEEE 1985), 281-288. G. Cormack/R. Horspool/M. Kaiserswerth: Practical perfect hashing. Computer J. 28/1 (1985), 54-58. R. Enbody/H.C. Du: Dynamic hashing schemes. ACM Comp. Surveys 20/2 (1988), 85-113. R. Fagin/J. Nievergelt/N. Pippenger/H. Strong: Extendible hashing - a fast access method for dynamic files. ACM Trans. Database Systems 4/3 (1979), 315-344. "A disadvantage of hashing schemes in general is that as the size of the data file increases, so the number of collisions also increases, and the average access time increases correspondingly (because more and more time is spent performing sequential searches through sets of collisions). This paper describes an elegant variation on the basic hashing technique, in which it is guaranteed that no more than two secondary storage accesses are ever needed to locate the record corresponding to a given key." (8699 Date, 60, where also an outline of the new scheme is given.) P. Flajolet: On the performance evaluation of extendible hashing and trie searching. Acta Informatica 20 (1983), 345-369. P. Flajolet/C. Puech: Partial match retrieval of multidimensional data. J. ACM 33/2 (1986), 371-407. G. Gonnet/I. Munro: Efficient ordering of hash tables. SIAM. J. Computing 8/3 (1979), 463-478. G. Gonnet: Handbook of algorithms and data structures. Addison-Wesley 1984. K. Hinrichs: The grid file system. Implementation and case studies of applications. Dissertation ETH Zuerich 1985. Ellis Horowitz/Sartaj Sahni: Fundamentals of data structures. Computer Science Press 1976. R. Jueneman: Electronic document authentication. IEEE Network Magazine 1/2 (1987), 17-23. 2129/3 Donald Knuth: The art of computer programming III. Addison-Wesley 1973. Hashing is discussed on pages 506-570 [7920]. P. Larson: Dynamic hashing. BIT 18 (1978), 184-201. P. Larson: Linear hashing with partial expansions. Proc. 6th Conf. on Very Large Data Bases 1980, 224-232. P. Larson: Dynamische Hashverfahren. Informatik-Spektrum 6/1 (1983), 7-19. 7629 P. Larson: Dynamic hash tables. Comm. ACM 31/4 (1988), 446-457. W. Litwin: Virtual hashing. A dynamically changing hashing. Proc. 4th Conf. on Very Large Data Bases 1978, 517-523. W. Litwin: Hachage virtuel. Une nouvelle technique d'adressage de memoires. PhD Thesis Univ. Paris VI, 1979. W. Litwin: Linear hashing. A new tool for file and table addressing. Proc. 6th Conf. on Very Large Data Bases 1980, 212-223. V. Lum/P. Yuen: Additional results on key-to-address transform techniques. A fundamental performance study on large existing formatted files. Comm. ACM 15/11 (1972), ... V. Lum/P. Yuen/M. Dodd: Key-to-address transform files. Comm. ACM 14/11 (1971), 228-239. G. Lyon: Packed scatter tables. Comm. ACM 21 (1978), 857-865. E. Mallach: Scatter storage techniques. A unifying viewpoint and a method for reducing retrieval times. Computer J. 20/2 (1977), 137-140. Y. Mansour/N. Nisan/P. Tiwari: The computational complexity of universal hashing. Theor. Computer Science 107 (1993), 121-133. W. Maurer/T. Lewis: Hash table methods. ACM Comp. Surveys 7/1 (1975), ... H. Mendelson: Analysis of extendible hashing. IEEE Trans. Softw. Eng. SE-8/6 (1982), 611-619. R. Merkle: Secrecy, authentication, and public key systems. UMI Research Press 1979. R. Merkle: One-way hash functions and DES. In CRYPTO '89, SLN Computer Science 435 (1989), 428-446. 3757 Thomas Ottmann/Peter Widmayer: Algorithmen und Datenstrukturen. Bibl. Inst. 1990. W. Peterson: Addressing for random-access storage. IBM J. Res. and Dev. 1 (1957), 130-146. 6103 J. Pieprzyk/B. Sadeghiyan: Design of hashing algorithms. Springer 1993, 200p. 3-540-57500-6. DM 52. G. Poonan: Optimal placement of entries in hash tables. ACM Computer Science Conference 25 (1976), ... M. Ramakrishna: Practical performance of bloom filters and parallel free-text searching. Comm. ACM 32/10 (1989), ... K. Ramamohanarao/R. Sacks-Davis: Recursive linear hashing. ACM Trans. Database Systems 9/3 (1984), 369-391. M. Regnier: Analysis of grid file algorithms. BIT 25/2 (1985), 335-357. Ronald Rivest: Partial-match retrieval algorithms. SIAM J. Comput. 5 (1976), 19-50. 7628 Ronald Rivest: Optimal arrangement of keys in a hash table. J. ACM 25/2 (1978), 200-209. D. Sarwate: A note on universal classes of hash functions. Information Processing Letters 10 (1980), 41-45. 7624 Vera Sos: On the theory of diophantine approximations. Acta Math. 8 (1957), 461-471. T. Standish: Data structure techniques. Addison-Wesley 1989. Douglas Stinson: Combinatorial techniques for universal hashing. J. Computer and System Sciences 48 (1994), 337-346. 7585 Douglas Stinson: On the connections between universal hashing, combinatorial designs and error-correcting codes. Internet 1996, 21p. M. Tamminen: Order preserving extendible hashing and bucket tries. BIT 21/4 (1981), 419-435. M. Tamminen: The extendible cell method for closest point problems. BIT 22 (1982), 27-41. M. Wegman/J. Carter: New hash functions and their use in authentication and set equality. J. Computer and System Sciences 22 (1981), 265-279. 7592 Avi Widgerson: Lectures on the fusion method and derandomization. Technical Report SOCS-95.2, School of Computer Science, McGill University 1995. F. Williams: Handling identifiers as internal symbols in language processors. Comm. ACM 2/6 (1959), 21-24.