1. Achlioptas, D., Moore, C.: The asymptotic order of the k-SAT threshold. In: Proc. 43rd FOCS, pp. 779–788 (2002)
2. Achlioptas, D., Naor, A., Peres, Y.: The fraction of satisfiable clauses in a typical formula. In: Proc. 44th FOCS, pp. 362–370 (2003)
3. Achlioptas, D., Peres, Y.: The threshold for random k-SAT is 2 k ln 2−O(k). In: Proc. 35th STOC, pp. 223–231 (2003)
4. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. Comput. 26, 1733–1748 (1997)
5. Ben-Sasson, E.: Expansion in Proof Complexity. PhD thesis, http://www.eecs.harvard.edu/~eli/papers/thesis.ps.gz