C. P. Gomes, B. Selman, and H. Kautz, Boosting combinatorial search through randomization, Proceedings of the National Conference on Artificial Intelligence, AAAI'98, pp.431-437, 1998.

L. Guo, Y. Hamadi, S. Jabbour, and L. Sais, Diversification and Intensification in Parallel SAT Solving, International Conference on Principles and Practice of Constraint Programming, pp.252-265, 2010.
DOI : 10.1007/978-3-642-15396-9_22
URL : https://hal.archives-ouvertes.fr/hal-00865417

Y. Hamadi, S. Jabbour, and L. Sais, ManySAT : a parallel SAT solver, Journal on Satisfiability Boolean Modeling and Computation, vol.6, pp.245-262, 2009.

J. Huang, The effect of restarts on the efficiency of clause learning, Proceedings of the International Joint Conference on Artificial Intelligence , IJCAI'2007, pp.2318-2323, 2007.

H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, and B. Selman, Dynamic restart policies, Proceedings of the National Conference on Artificial Intelligence (AAAI'02), pp.674-682, 2002.

P. Joao, K. A. Marques-silva, and . Sakallah, GRASP -A New Search Algorithm for Satisfiability, Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp.220-227, 1996.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff, Proceedings of the 38th conference on Design automation , DAC '01, pp.530-535, 2001.
DOI : 10.1145/378239.379017

K. Pipatsrisawat and A. Darwiche, A Lightweight Component Caching Scheme for Satisfiability Solvers, International Conference ,Theory and Applications of Satisfiability Testing, pp.294-299, 2007.
DOI : 10.1007/978-3-540-72788-0_28

K. Pipatsrisawat and A. Darwiche, Widthbased restart policies for clause-learning satisfiability solvers, International Conference ,Theory and Applications of Satisfiability Testing, pp.341-355, 2009.

R. Williams, C. Gomes, and B. Selman, Backdoors to typical case complexity, Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'2003, pp.1173-1178, 2003.

R. Williams, C. Gomes, and B. Selman, On the connections between backdoors, restarts, and heavy-tailedness in combinatorial search, International Conference on Theory and Applications of Satisfiability Testing, SAT'2003, pp.222-230, 2003.