

![0_image_0.png](0_image_0.png)

[2] C. J. Bouwkamp & A. J. W. Duijvestijn (1992): *Catalogue of Simple Perfect Squared Squares of orders* 21 through 25. Technical Report Technical Report 92 WSK 03, University of Technology, Department of Mathematics and Computer Science, Eindhoven, The Netherlands.

[3] Geoffrey Chu & Peter Stuckey (2008): *A parallelization of MiniSAT 2.0*. In: *SAT race*.

[4] Philippe Codognet & Daniel Diaz (2001): *Yet Another Local Search Method for Constraint Solving*.

In: *SAGA*. pp. 73–90. Available at http://link.springer.de/link/service/series/0558/bibs/
2264/22640073.htm.

[5] Philippe Codognet & Daniel Diaz (2003): *An Efficient Library for Solving CSP with Local Search*. In:
T. Ibaraki, editor: *MIC'03, 5th International Conference on Metaheuristics*. http://pauillac.inria.

fr/~diaz/adaptive/.

[6] Ian P. Gent & Toby Walsh (1999): *CSPLIB: A Benchmark Library for Constraints*. In: CP. pp. 480–481.

http://www.csplib.org.

[7] Youssef Hamadi, Sa¨ıd Jabbour & Lakhdar Sais (2009): ManySAT: a Parallel SAT Solver. *Journal on Satisfiability, Boolean Modeling and Computation* 6, pp. 245–262.

[8] Gerard J. Holzmann & Dragan Bosnacki (2007): The Design of a Multicore Extension of the SPIN Model Checker. *IEEE Transactions on Software Engineering* 33(10), pp. 659–674. Available at http://doi.

ieeecomputersociety.org/10.1109/TSE.2007.70724.

[9] Jacques Chassin de Kergommeaux & Philippe Codognet (1994): Parallel Logic Programming Systems. ACM
Computing Surveys 26(3), pp. 295–336.

[10] J. H. van Lint & R.M. Wilson (1992): *A Course in Combinatorics*. Cambridge University Press.