1. D. Achlioptas, Setting two variables at a time yields a new lower bound for random 3-SAT, in: 32nd Annual ACM Symp. on Theory of Computing, Portland, OR, 2000, ACM, New York, 2000, pp. 28–37
2. D. Achlioptas, J.H. Kim, M. Krivelevich, P. Tetali, Two-coloring random hypergraphs, in: RANDOM’00 Geneva, 2000, Proc. Inform., Vol. 8, Carleton Scientific, Waterloo, 2000, pp. 85–96.
3. D. Achlioptas, L.M. Kirousis, E. Kranakis, D. Krizanc, Rigorous results for random (2+p)-SAT, in: RALCOM ’97, Santorini, 1997, 1–13, 1997, pp.
4. D. Achlioptas, L. M. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, Y. Stamatiou, Random constraint satisfaction: a more accurate picture, Constraints, to appear.
5. D. Achlioptas, M. Molloy, The analysis of a list-coloring algorithm on a random graph, in: 38th Annual Symp. on Foundations of Computer Science, Miami, FL, 1997, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 204–212.