M. Abramowitz and I. A. Stegun, Handbook of Mathematical Functions, American Journal of Physics, vol.34, issue.2, 1972.
DOI : 10.1119/1.1972842

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
URL : http://comjnl.oxfordjournals.org/cgi/content/short/17/2/135

C. Bruce and . Berndt, Ramanujan's Notebooks, Part II, 1989.

I. F. Blake and A. G. 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. P. 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

A. Broder, Two counting problems solved via string encodings, Combinatorial Algorithms on Words NATO Advance Science Institute Series. Series F: Computer and System Sciences, pp.229-240, 1985.
DOI : 10.1007/978-3-642-82456-2_15

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. I. Munro, Robin hood hashing, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.281-288, 1985.
DOI : 10.1109/SFCS.1985.48

P. Chassaing and G. Louchard, Phase transition for parking blocks, brownian excursion and coalescence . Random Structures & Algorithms, pp.76-119, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00003777

P. Chassaing and J. Marckert, Parking functions, empirical processes, and the width of rooted labeled trees, Electronic Journal of Combinatorics, vol.8, issue.1, 2001.

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. Grabner, P. Kirschenhofer, and H. Prodinger, On Ramanujan's Q-function, Journal of Computational and Applied Mathematics, vol.58, issue.1, pp.103-116, 1995.
DOI : 10.1016/0377-0427(93)E0258-N

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

P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009.
DOI : 10.1017/CBO9780511801655
URL : https://hal.archives-ouvertes.fr/inria-00072739

P. Flajolet and A. M. Odlyzko, Random Mapping Statistics, Advances in Cryptology Proceedings of EUROCRYPT'89, pp.329-354, 1989.
DOI : 10.1007/3-540-46885-4_34
URL : https://hal.archives-ouvertes.fr/inria-00075445

P. Flajolet and A. M. Odlyzko, Singularity Analysis of Generating Functions, SIAM Journal on Discrete Mathematics, vol.3, issue.2, pp.216-240, 1990.
DOI : 10.1137/0403019
URL : https://hal.archives-ouvertes.fr/inria-00075725

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

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

G. H. Gonnet and J. I. 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

I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, 1983.

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. Janson, Individual displacements for linear probing hashing with different insertion policies, ACM Transactions on Algorithms, vol.1, issue.2, 2005.
DOI : 10.1145/1103963.1103964

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, An analysis of optimum caching, Journal of Algorithms, vol.6, issue.2, pp.181-199, 1985.
DOI : 10.1016/0196-6774(85)90037-9

D. E. Knuth, The Art of Computer Programming, volume 1 Fundamental Algorithms, 1997.

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

D. E. Knuth, The Art of Computer Programming, volume 2 Seminumerical Algorithms, 1998.

D. E. Knuth and G. S. Rao, Activity in an Interleaved Memory, IEEE Transactions on Computers, vol.24, issue.9, pp.943-944, 1975.
DOI : 10.1109/T-C.1975.224344

D. E. Knuth and A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoretical Computer Science, vol.6, issue.3, pp.281-315, 1978.
DOI : 10.1016/0304-3975(78)90009-9

E. Donald and . Knuth, Linear probing and graphs, Algorithmica, vol.22, issue.4, pp.561-568, 1998.

A. G. 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

J. W. Moon, Counting labelled trees, Canadian Mathematical Monographs, 1970.

A. M. Odlyzko, Asymptotic enumeration methods, Handbook of Combinatorics, pp.1063-1229, 1995.

T. Prellberg, P. Cameron, D. Johannsen, and P. Schweitzer, Counting defective parking functions, Electronic Journal of Combinatorics, vol.15, issue.1, 2008.

A. Panholzer, On a discrete parking problem, 2008.

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. V. Poblete, Approximating functions by their poisson transform, Information Processing Letters, vol.23, issue.3, pp.127-130, 1986.
DOI : 10.1016/0020-0190(86)90111-0

P. V. Poblete and J. I. 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

P. V. Poblete, A. Viola, and J. I. Munro, The Diagonal Poisson Transform and its application to the analysis of a hashing scheme, Random Structures & Algorithms, vol.41, issue.3, pp.221-255, 1997.
DOI : 10.1002/(SICI)1098-2418(199701/03)10:1/2<221::AID-RSA12>3.0.CO;2-B

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

G. Seitz, Parking functions and generalizations, 2009.

A. Viola, Analysis of Hashing Algorithms and a New Mathematical Transform, 1995.

A. Viola, Exact distribution of individual displacements in linear probing hashing, ACM Transactions on Algorithms, vol.1, issue.2, pp.214-242, 2005.
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