1. Achlioptas, D., Beame, P. and Molloy, M.: A sharp threshold in proof complexity, J. Comput. Syst. Sci. (2003).
2. Achlioptas, D., Beame, P. and Molloy, M.: Exponential bounds for DPLL below the satisfiability threshold, in Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'04, 2004, pp. 139–140.
3. Achlioptas, D. and Sorkin, G. B.: Optimal myopic algorithms for random 3-SAT, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, FOCS'00, 2000.
4. Alekhnovich, M. and Ben-Sasson, E.: Analysis of the random walk algorithm on random 3-CNFs, Manuscript, 2002.
5. Alekhnovich, M., Ben-Sasson, E., Razborov, A. and Wigderson, A.: Pseudorandom generators in propositional complexity, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, FOCS'00, Journal version is to appear in SIAM Journal on Computing, 2000.