Hash tables

[1]  W. W. Peterson,et al.  Addressing for Random-Access Storage , 1957, IBM J. Res. Dev..

[2]  S. Swierczkowski.  On successive settings of an arc on the circumference of a circle , 1958 .

[3]  Andrei P. Ershov.  On programming of arithmetic operations , 1958, CACM.

[4]  Werner Buchholz,et al.  File Organization and Addressing , 1963, IBM Syst. J..

[5]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  Donald E. Knuth,et al.  Ordered Hash Tables , 1974, Comput. J..

[8]  Norman L. Johnson,et al.  Urn models and their application , 1977 .

[9]  Renzo Sprugnoli,et al.  Perfect hashing functions , 1977, Commun. ACM.

[10]  Efrem G. Mallach.  Scatter Storage Techniques: A Unifying Viewpoint and a Method for Reducing Retrieval Times , 1977, Comput. J..

[11]  Gordon Lyon,et al.  Packed scatter tables , 1978, CACM.

[12]  Ronald L. Rivest.  Optimal Arrangement of Keys in a Hash Table , 1978, JACM.

[13]  Witold Litwin,et al.  Virtual Hashing: A Dynamically Changing Hashing , 1978, VLDB.

[14]  Andrew Chi-Chih Yao,et al.  Should Tables Be Sorted? , 1981, JACM.

[15]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[16]  M. G. Anderson,et al.  Comments on perfect hashing functions: a single probe retrieving method for static sets , 1979, CACM.

[17]  Robert E. Tarjan,et al.  Storing a sparse table , 1979, CACM.

[18]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[19]  Richard J. Cichelli.  Minimal perfect hash functions made simple , 1980, CACM.

[20]  Gaston H. Gonnet,et al.  Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.

[21]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[22]  Robert H. Morris,et al.  Scatter storage techniques , 1983, CACM.

[23]  Chin-Chen Chang.  An ordered minimal perfect hashing scheme based upon Euler's theorem , 1984, Inf. Sci..

[24]  Torben U. Zahle,et al.  Cascade Hashing , 1984, VLDB.

[25]  C. C. Chang.  The study of an ordered minimal perfect hashing scheme , 1984, CACM.

[26]  J. Ian Munro,et al.  Robin hood hashing , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[27]  Thomas J. Sager.  A polynomial time generator for minimal perfect hash functions , 1985, CACM.

[28]  J. Ian Munro,et al.  Techniques for Collision Resolution in Hash Tables with Open Addressing , 1986, FJCC.

[29]  Francine Berman,et al.  Collections of Functions for Perfect Hashing , 1986, SIAM J. Comput..

[30]  Wen-Chin Chen,et al.  Design and Analysis of Coalesced Hashing , 1986 .

[31]  János Körner,et al.  New Bounds for Perfect Hashing via Information Theory , 1988, Eur. J. Comb..

[32]  Giovanni Soda,et al.  An algebraic approach to Cichelli's perfect hashing , 1989, BIT Comput. Sci. Sect..

[33]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[34]  G. H. Gonnet,et al.  Handbook of algorithms and data structures: in Pascal and C (2nd ed.) , 1991 .

[35]  Wojciech Rytter,et al.  Analysis of algorithms and data structures , 1991, International computer science series.

[36]  Friedhelm Meyer auf der Heide,et al.  Efficient PRAM simulation on a distributed memory machine , 1992, STOC '92.

[37]  Friedhelm Meyer auf der Heide,et al.  Dynamic Perfect Hashing: Upper and Lower Bounds , 1994, SIAM J. Comput..

[38]  George Havas,et al.  Perfect Hashing , 1997, Theor. Comput. Sci..

[39]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[40]  J. Ian Munro,et al.  Membership in Constant Time and Almost-Minimum Space , 1999, SIAM J. Comput..