R. Pagh and F. F. Rodler, Cuckoo hashing, ESA, ser. Lecture Notes in Computer Science, F. Meyer auf der Heide, pp.121-133, 2001.

A. Frieze, P. Melsted, and M. Mitzenmacher, An analysis of randomwalk cuckoo hashing, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp.490-503, 2009.

N. Fountoulakis, K. Panagiotou, and A. Steger, On the Insertion Time of Cuckoo Hashing, SIAM Journal on Computing, vol.42, issue.6, 1006.
DOI : 10.1137/100797503

M. Khosla, Balls into Bins Made Faster, ESA, ser. Lecture Notes in Computer Science, 2013.
DOI : 10.1007/978-3-642-40450-4_51

D. Zuckerman, Simulating BPP using a general weak random source, Algorithmica, vol.7, issue.4, pp.367-391, 1996.
DOI : 10.1007/BF01940870

S. Vembu and S. Verdú, Generating random bits from an arbitrary source: Fundamental limits Information Theory, IEEE Transactions on, vol.41, issue.5, pp.1322-1332, 1995.

M. Mitzenmacher, Balanced allocations and double hashing, Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, SPAA '14, 1209.
DOI : 10.1145/2612669.2612684

L. J. Guibas and E. Szemeredi, The analysis of double hashing, Journal of Computer and System Sciences, vol.16, issue.2, pp.226-274, 1978.
DOI : 10.1016/0022-0000(78)90046-6

G. Lueker and M. Molodowitch, More analysis of double hashing, Proceedings of the twentieth annual ACM symposium on Theory of computing, pp.354-359, 1988.

M. Lelarge, A New Approach to the Orientation of Random Hypergraphs, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, ser. SODA '12. SIAM, 2012, pp.251-264
DOI : 10.1137/1.9781611973099.23
URL : https://hal.archives-ouvertes.fr/hal-01270322

M. Leconte, M. Lelarge, and L. Massoulié, Convergence of Multivariate Belief Propagation, with Applications to Cuckoo Hashing and Load Balancing, pp.35-46, 2013.
DOI : 10.1137/1.9781611973105.3
URL : https://hal.archives-ouvertes.fr/hal-00827810

N. Fountoulakis and K. Panagiotou, Orientability of Random Hypergraphs and the Power of Multiple Choices, Automata, Languages and Programming, pp.348-359, 2010.
DOI : 10.1007/978-3-642-14165-2_30

M. Dietzfelbinger, A. Goerdt, M. Mitzenmacher, A. Montanari, R. Pagh et al., Tight Thresholds for Cuckoo Hashing via XORSAT, Proceedings of the 37th international colloquium conference on Automata, languages and programming, ser. ICALP'10, pp.213-225, 2010.
DOI : 10.1007/978-3-642-14165-2_19

A. Frieze and P. Melsted, Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Random Structures & Algorithms, vol.31, issue.3, pp.334-364, 2012.
DOI : 10.1002/rsa.20427

M. Dietzfelbinger and C. Weidling, Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins, ICALP, ser, pp.166-178, 2005.
DOI : 10.1007/11523468_14

J. A. Cain, P. Sanders, and N. Wormald, The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.469-476, 2007.

D. Fernholz and V. Ramachandran, The k-orientability thresholds for gn, p, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.459-468, 2007.

P. Gao, N. C. Wormald, C. Bordenave, M. Lelarge, and J. Salez, Load balancing and orientability thresholds for random hypergraphs, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.97-104, 2010.
DOI : 10.1145/1806689.1806705

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced Allocations, SIAM Journal on Computing, vol.29, issue.1, pp.180-200, 1999.
DOI : 10.1137/S0097539795288490

M. Mitzenmacher and J. Thaler, Peeling arguments and double hashing, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp.1118-1125, 2012.
DOI : 10.1109/Allerton.2012.6483344

D. Aldous and R. Lyons, Processes on Unimodular Random Networks, Electronic Journal of Probability, vol.12, issue.0, pp.1454-1508, 2007.
DOI : 10.1214/EJP.v12-463

C. Bordenave, Lecture notes on random graphs and probabilistic combinatorial optimization!! draft in construction!!, 2012.