1. Can't get no satisfaction;Hayes;American Scientist,1997
2. A threshold for unsatisfiability;Goerdt;J. Comp. System Sci.,1996
3. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-sat problem;Friedgut;Journal of the AMS,1999
4. Probability Approximations Via the Poisson Clumping Heuristic;Aldous,1989
5. Applications of non-commutative Fourier analysis to probability problems;Diaconis,1989