Y. Hamadi, S. Jabbour, and L. Sais, ManySAT: A Parallel SAT Solver, Journal on Satisfiability Boolean Modeling and Computation, JSAT, vol.6, pp.245-262, 2009.

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

L. Bordeaux, Y. Hamadi, and L. Zhang, Propositional Satisfiability and Constraint Programming, ACM Computing Surveys, vol.38, issue.4, 2006.
DOI : 10.1145/1177352.1177354

H. H. Hoos and T. Stützle, Local Search Algorithms for SAT: An Empirical Evaluation, Journal of Automated Reasoning, vol.24, issue.4, pp.421-481, 2000.
DOI : 10.1023/A:1006350622830

B. Selman, H. J. Levesque, and D. G. Mitchell, A New Method for Solving Hard Satisfiability Problems, pp.440-446, 1992.

B. Selman, H. A. Kautz, and B. Cohen, Noise Strategies for Improving Local Search, In: AAAI, pp.337-343, 1994.

D. A. Mcallester, B. Selman, and H. A. Kautz, Evidence for Invariants in Local Search, In: AAAI/IAAI, pp.321-326, 1997.

C. M. Li and W. Q. Huang, Diversification and Determinism in Local Search for Satisfiability, SAT'05, pp.158-172, 2005.
DOI : 10.1007/11499107_12

F. Hutter, D. A. Tompkins, and H. H. Hoos, Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT, LNCS, vol.2470, pp.233-248, 2002.
DOI : 10.1007/3-540-46135-3_16

J. Thornton, D. N. Pham, S. Bain, and V. Ferreira-jr, Additive versus Multiplicative Clause Weighting for SAT, pp.191-196, 2004.

H. H. Hoos, An Adaptive Noise Mechanism for WalkSAT, pp.655-660, 2002.

C. M. Li, W. Wei, and H. Zhang, Combining Adaptive Noise and Look-Ahead in Local Search, LNCS, vol.4501, pp.121-133, 2007.

W. Chrabakh and R. Wolski, GridSAT: a system for solving satisfiability problems using a computational grid, Parallel Computing, vol.32, issue.9, pp.660-687, 2006.
DOI : 10.1016/j.parco.2006.01.004

W. Zhang, Z. Huang, and J. Zhang, Parallel Execution of Stochastic Search Procedures on Reduced SAT Instances, Pacific Rim International Conferences on Artificial Intelligence (PRICAI, pp.108-117, 2002.
DOI : 10.1007/3-540-45683-X_14

A. Roli, Criticality and Parallelism in Structured SAT Instances, LNCS, vol.2470, pp.714-719, 2002.
DOI : 10.1007/3-540-46135-3_51

A. Roli, M. J. Blesa, and C. Blum, Random Walk and Parallelism in Local Search, Metaheuristic International Conference (MIC'05), 2005.

D. N. Pham and C. Gretton, gNovelty+ (v.2) In: Solver description, SAT competition, 2009.

L. Kroc, A. Sabharwal, C. P. Gomes, and B. Selman, Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT, pp.544-551, 2009.

T. Hogg and C. P. Williams, Solving the Really Hard Problems with Cooperative Search, In: AAAI, pp.231-236, 1993.

D. L. Silva and E. K. Burke, Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem, INFORMS Journal on Computing, vol.19, issue.4, pp.575-587, 2007.
DOI : 10.1287/ijoc.1060.0200

B. Selman and H. A. Kautz, Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems, In: IJCAI, pp.290-295, 1993.

D. A. Tompkins and H. H. Hoos, UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT, LNCS, vol.3542, pp.306-320, 2004.
DOI : 10.1007/11527695_24

F. Hutter, H. H. Hoos, and K. Leyton-brown, Tradeoffs in the empirical evaluation of competing algorithm designs, Special Issue on Learning and Intelligent Optimization, 2010.
DOI : 10.1007/s10472-010-9191-0