1. D. Achlioptas, C. Moore, The asymptotic order of the random k-SAT thresholds, in 43rd Annual Symposium on Foundations of Computer Science (IEEE Computer Society, Los Alamitos, 2002)
2. D. Achlioptas, Y. Peres, The threshold for random k-SAT is 2klog2 − O(k). J. Am. Math. Soc. 17, 947–973 (2004)
3. D. Achlioptas, G. Sorkin, Optimal myopic algorithms for random 3-SAT, in 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, California (IEEE Computer Society, Los Alamitos, 2000), pp. 590–600
4. A. Agrawal, P. Klein, R. Ravi, When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput. 24, 440–456 (1995)
5. R. Aharoni, N. Linial, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Comb. Theory A 43, 196–204 (1986)