]. D. Ald and . Aldous, My favorite 6 open problems in mathematical probability

]. D. Ald92 and . Aldous, Asymptotics in the random assignment problem, Probab.Th.Rel.Fields, issue.93, pp.507-534, 1992.

D. Aldous, The ? 2¢ limit in the random assignment problem, Random Structures and Algorithms, issue.18, pp.381-418, 2001.

C. [. Achlioptas and . Moore, The asymptotic order of the random k-SAT threshold, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2002.
DOI : 10.1109/SFCS.2002.1182003

J. Aronson, B. Pittel, and A. Frieze, Maximum matchings in sparse random graphs: Karp- Sipser revisited. Random Structures and Algorithms, pp.11-178, 1998.

J. [. Aldous and . Steele, The Objective Method: Probabilistic Combinatorial Optimization and Local Weak Convergence, 2003.
DOI : 10.1007/978-3-662-09444-0_1

B. [. Chvatal and . Reed, Mick gets some (the odds are on his side), Proc. 33d Symposium on Foundations of Computer Science, 1992.

Y. [. Dubois, J. Boufkhad, and . Mandler, Typical random 3-SAT formulae and the satisfiability threshold, Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.

]. W. Fernandez-de and L. Vega, On random 2-SAT. Unpublished manuscript, 1992. [Fri99] E. Friedghut. Sharp thresholds of graph proprties, and the k-SAT problem, J. Amer. Math. Soc, vol.4, pp.1017-1054, 1999.

A. Frieze and N. Wormald, Random k-Sat: A Tight Threshold For Moderately Growing k, Proceedings of the Fifth International Symposium on Theory and Applications of Satisfiability Testing, pp.1-6, 2002.
DOI : 10.1007/s00493-005-0017-3

]. A. Goe92 and . Goerdt, A threshold for unsatisfiability, 17th International Symposium. I. M. Havel and V. Koubek, pp.264-274, 1992.

]. A. Goe96 and . Goerdt, A threshold for unsatisfiability, J. Computer and System Sciences, vol.53, pp.469-486, 1996.

S. Janson, T. Luczak, and A. Rucinski, Random Graphs, 2000.
DOI : 10.1002/9781118032718

A. C. Kaporis, L. M. Kirousis, and E. Lalas, The probabilistic analysis of a greedy satisfiability algorithm, 5-th International Symposium on the Theory and Applications of Satisfiability Testing, pp.362-376, 2002.

M. [. Karp and . Sipser, Maximum matching in sparse random graphs, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981), pp.364-375, 1981.
DOI : 10.1109/SFCS.1981.21

R. Langlands, P. Pouliot, and Y. Saint-aubin, Conformal invariance in two-dimensional percolation, Bulletin of the American Mathematical Society, vol.30, issue.1, pp.1-61, 1994.
DOI : 10.1090/S0273-0979-1994-00456-2

M. Mézard and G. Parisi, On the solution of the random link matching problems, Journal de Physique, vol.48, issue.9, pp.1451-1459, 1987.
DOI : 10.1051/jphys:019870048090145100

K. [. Papadimitriou and . Steiglitz, Combinatorial optimization: algorithms and complexity, 1998.

O. Schramm, A Percolation Formula, Electronic Communications in Probability, vol.6, issue.0, pp.115-120, 2001.
DOI : 10.1214/ECP.v6-1041

]. J. Ste02 and . Steele, Minimal spanning trees for graphs with random edge lenghts Mathematics and Computer Science II. Algorithms, Trees, Combinatorics and Probabilities, pp.223-246, 2002.

S. Smirnov and W. Werner, Critical exponents for two-dimensional percolation, Mathematical Research Letters, vol.8, issue.6, pp.729-744, 2001.
DOI : 10.4310/MRL.2001.v8.n6.a4
URL : https://hal.archives-ouvertes.fr/hal-00119178