1. D. Achlioptas, C. Moore, The asymptotic order of the k-SAT threshold, Proc. 43rd FOCS, 2002, pp. 779–788.
2. D. Achlioptas, A. Naor, Y. Peres, The fraction of satisfiable clauses in a typical formula, Proc. 44th FOCS, 2003, pp. 362–370.
3. D. Achlioptas, Y. Peres, The threshold for random k-SAT is 2k ln 2 - O(k), Proc. 35th STOC, 2003, pp. 223–231.
4. A spectral technique for coloring random 3-colorable graphs;Alon;SIAM J. Comput.,1997
5. Complexity and approximation—combinatorial optimization problems and their approximability properties;Ausiello,1999