T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2001.

L. Devroye and P. Morin, Cuckoo hashing: Further analysis, Information Processing Letters, vol.86, issue.4, pp.215-219, 2003.
DOI : 10.1016/S0020-0190(02)00500-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.8867

M. Dietzfelbinger and U. Schellbach, On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.795-804, 2009.
DOI : 10.1137/1.9781611973068.87

M. Dietzfelbinger and C. Weidling, Balanced allocation and dictionaries with tightly packed constant size bins, Theoretical Computer Science, vol.380, issue.1-2, pp.47-68, 2007.
DOI : 10.1016/j.tcs.2007.02.054
URL : http://doi.org/10.1016/j.tcs.2007.02.054

M. Drmota, A Bivariate Asymptotic Expansion of Coefficients of Powers of Generating Functions, European Journal of Combinatorics, vol.15, issue.2, pp.139-152, 1994.
DOI : 10.1006/eujc.1994.1016

M. Drmota and R. Kutzelnigg, A precise analysis of Cuckoo hashing, ACM Transactions on Algorithms, vol.8, issue.2, 2009.
DOI : 10.1145/2151171.2151174

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

D. Fotakis, R. Pagh, P. Sanders, and P. G. Spirakis, Space Efficient Hash Tables with Worst Case Constant Access Time, Theory of Computing Systems, vol.38, issue.2, pp.229-248, 2005.
DOI : 10.1007/s00224-004-1195-x

D. Gardy, Some results on the asymptotic behaviour of coefficients of large powers of functions, Discrete Mathematics, vol.139, issue.1-3, pp.189-217, 1995.
DOI : 10.1016/0012-365X(94)00133-4

O. Gimenez, A. De-mier, and M. Noy, On the Number of Bases of Bicircular Matroids, Annals of Combinatorics, vol.9, issue.1, pp.35-45, 2005.
DOI : 10.1007/s00026-005-0239-x

I. J. Good, Saddle-point Methods for the Multinomial Distribution, The Annals of Mathematical Statistics, vol.28, issue.4, pp.861-881, 1957.
DOI : 10.1214/aoms/1177706790

S. Janson, D. E. Knuth, T. ?uczak, and B. Pittel, The birth of the giant component. Random Structures and Algorithms, pp.233-359, 1993.

A. Kirsch, M. Mitzenmacher, and U. Wieder, More robust hashing: Cuckoo hashing with a stash, Proceedings of the 16th Annual European Symposium on Algorithms, 2008.

D. E. Knuth, The Art of Computer Programming, Volume III: Sorting and Searching, 1998.

R. Kutzelnigg, Random Graphs and Cuckoo Hashing Südwestdeutscher Verlag für Hochschulschriften, 2009.

R. Kutzelnigg, An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations, Mathematics in Computer Science, vol.50, issue.4, pp.47-60, 2010.
DOI : 10.1007/s11786-009-0005-x

R. Pagh and F. F. Rodler, Cuckoo hashing, Journal of Algorithms, vol.51, issue.2, pp.122-144, 2004.
DOI : 10.1016/j.jalgor.2003.12.002