1. Alekhnovich, M., Ben-Sasson, E.: Linear upper bounds for random walk on small density random 3-cnf. In: Proc. 44th IEEE Symp. on Found. of Comp. Science, pp. 352–361 (2003)
2. Alon, N., Kahale, N.: A spectral technique for coloring random 3-colorable graphs. SIAM J. on Comput. 26(6), 1733–1748 (1997)
3. Braunstein, A., Mezard, M., Zecchina, R.: Survey propagation: an algorithm for satisfiability. Random Structures and Algorithms 27, 201–226 (2005)
4. Broder, A.Z., Frieze, A.M., Upfal, E.: On the satisfiability and maximum satisfiability of random 3-cnf formulas. In: Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pp. 322–330 (1993)
5. Dubois, O., Boufkhad, Y., Mandler, J.: Typical random 3-sat formulae and the satisfiability threshold. In: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, pp. 126–127 (2000)