1. Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract);Achlioptas,2000
2. Lower bounds for random 3-SAT via differential equations;Achlioptas;Theor. Comput. Sci.,2001
3. The threshold for random k-SAT is 2klog2−O(k);Achlioptas;J. Am. Math. Soc.,2004
4. Optimal myopic algorithms for random 3-SAT;Achlioptas,2000
5. New logical and complexity results for signed-sat;Ansótegui,2003