1. D. Achlioptas, Threshold Phenomena in random graph coloring and satisfiability, Ph.D. Thesis, Department of Computer Science, University of Toronto, 1999.
2. D. Achlioptas, Setting 2 variables at a time yields a new lower bound for random 3-SAT, in: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, May 2000, pp. 28–37.
3. A survey of lower bounds for random 3-SAT via differential equations;Achlioptas;Theoret. Comput. Sci.,2001
4. Rigorous results for random (2+p)-SAT;Achlioptas;Theoret. Comput. Sci.,2001
5. D. Achlioptas, Y. Peres, The random k-SAT threshold is 2kln2−O(k), in: 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, 223–231.