O. Amble and D. E. Knuth, Ordered hash tables, The Computer Journal, vol.17, issue.2, pp.135-142, 1974.
DOI : 10.1093/comjnl/17.2.135

I. Blake and A. Konheim, Big Buckets Are (Are Not) Better!, Journal of the ACM, vol.24, issue.4, pp.591-606, 1977.
DOI : 10.1145/322033.322038

R. Brent, Reducing the retrieval time of scatter storage techniques, Communications of the ACM, vol.16, issue.2, pp.105-109, 1973.
DOI : 10.1145/361952.361964

S. Carlsson, J. Munro, and P. Poblete, On linear probing hashing, 1987.

P. Celis, Robin hood hashing, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1986.
DOI : 10.1109/SFCS.1985.48

P. Celis, P. Larson, and J. Munro, Robin hood hashing, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.281-288, 1985.
DOI : 10.1109/SFCS.1985.48

R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, Extendible hashing---a fast access method for dynamic files, ACM Transactions on Database Systems, vol.4, issue.3, pp.315-344, 1979.
DOI : 10.1145/320083.320092

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E

URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Flajolet, P. Poblete, and A. Viola, On the Analysis of Linear Probing Hashing, Algorithmica, vol.22, issue.4, pp.490-515, 1998.
DOI : 10.1007/PL00009236

URL : https://hal.archives-ouvertes.fr/inria-00073424

G. Gonnet and J. Munro, Efficient Ordering of Hash Tables, SIAM Journal on Computing, vol.8, issue.3, pp.463-478, 1979.
DOI : 10.1137/0208038

G. Gonnet and J. Munro, The analysis of linear probing sort by the use of a new mathematical transform, Journal of Algorithms, vol.5, issue.4, pp.451-470, 1984.
DOI : 10.1016/0196-6774(84)90001-4

G. H. Gonnet and R. Baeza-yates, Handbook of Algorithms and Data Structures, 1991.

P. Jacquet and M. Régnier, Trie partitioning process: Limiting distributions, Proceedings of the 11th Colloquium on Trees in Algebra and Programming, pp.196-210, 1986.
DOI : 10.1007/BFb0022669

S. Jason, Individual displacements for linear probing hashing with different insertion policies, 2003.

D. E. Knuth, Notes on " open " addressing. Unpublished memorandum With annotation " My first analysis of an algorithm, originally done during Summer 1962 in Madison " . Also conjectures the asymptotics of the Q-function, with annotation, 1963.

D. E. Knuth, The Art of Computer Programming, volume 3 Sorting and Searching, 1998.

D. E. Knuth, Linear Probing and Graphs, Algorithmica, vol.22, issue.4, pp.561-568, 1998.
DOI : 10.1007/PL00009240

URL : http://arxiv.org/abs/cs/9801103

A. Konheim and B. Weiss, An Occupancy Discipline and Applications, SIAM Journal on Applied Mathematics, vol.14, issue.6, pp.1266-1274, 1966.
DOI : 10.1137/0114101

P. Larson, Analysis of Uniform Hashing, Journal of the ACM, vol.30, issue.4, pp.805-819, 1983.
DOI : 10.1145/2157.322407

H. Mendelson, Analysis of linear probing with buckets, Information Systems, vol.8, issue.3, pp.207-216, 1983.
DOI : 10.1016/0306-4379(83)90007-8

W. W. Peterson, Addressing for Random-Access Storage, IBM Journal of Research and Development, vol.1, issue.2, pp.130-146, 1957.
DOI : 10.1147/rd.12.0130

P. Poblete and J. Munro, Last-come-first-served hashing, Journal of Algorithms, vol.10, issue.2, pp.228-248, 1989.
DOI : 10.1016/0196-6774(89)90014-X

R. Sedgewick, Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching, 1998.

A. Viola, Exact distribution of individual displacements in linear probing hashing, ACM Transactions on Algorithms, vol.1, issue.2, 2004.
DOI : 10.1145/1103963.1103965

A. Viola and P. V. Poblete, The Analysis of Linear Probing Hashing with Buckets, Algorithmica, vol.21, issue.1, pp.37-71, 1998.
DOI : 10.1007/PL00009208

URL : https://hal.archives-ouvertes.fr/hal-00990469