M. Gardner, Mathematics, magic and mystery. Dover publication, 1956.

J. Simpson, Langford sequences: perfect and hooked, Discrete Mathematics, vol.44, issue.1, pp.97-104, 1983.
DOI : 10.1016/0012-365X(83)90008-0
URL : https://doi.org/10.1016/0012-365x(83)90008-0

T. Walsh, Permutation Problems and Channelling Constraints APES Research Group APES-26-2001 Available from, 2001.

B. Smith, Modelling a Permutation Problem Workshop on Modelling and Solving Problems with Constraints, Proceedings of ECAI'2000, 2000.

J. Larsen, Counting the number of Skolem sequences using inclusion exclusion, 2009.

A. Assarpour, A. Barnoy, and O. Liu, Counting the Number of Langford Skolem Pairings, 2015.

C. Nvidia, Compute unified device architecture programming guide, 2007.

D. Kirk and W. Wh, Programming massively parallel processors: a hands-on approach, 2012.

Z. Habbas, M. Krajecki, and D. Singer, Parallelizing Combinatorial Search in Shared Memory, Proceedings of the fourth European Workshop on OpenMP, 2002.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.1, issue.4, pp.268-299, 1993.
DOI : 10.1016/0004-3702(77)90007-8

M. Krajecki, An Object Oriented Environment to Manage the Parallelism of the FIIT Applications, Parallel Computing Technologies, pp.229-235, 1999.
DOI : 10.1007/3-540-48387-X_25

V. Volkov, Better performance at lower occupancy, Proceedings of the GPU Technology Conference, p.16, 2010.

C. Jaillet, In french: Résolutionparalì ele desprobì emes combinatoires [PhD], 2005.

M. Jette and M. Grondona, SLURM : Simple Linux Utility for Resource Management, 2003.