1. Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. JCSS (2003)
2. Achlioptas, D., Beame, P., Molloy, M.: Exponential bounds for DPLL below the satisfiability threshold. In: SODA 2004 (2004)
3. Achlioptas, D., Sorkin, G.B.: Optimal myopic algorithms for random 3-SAT. In: FOCS 2000 (2000)
4. Alekhnovich, M., Ben-Sasson, E.: Analysis of the random walk algorithm on random 3-CNFs (2002) (manuscript)
5. Alekhnovich, M., Ben-Sasson, E., Razborov, A., Wigderson, A.: Pseudorandom generators in propositional complexity. In: FOCS 2000 (2000);