[1]

David P. Anderson and Gilles Fedak. The computational and storage potential of volunteer computing. In *Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006)*, *16-19 May 2006*, *Singapore*, pages 73–80. IEEE Computer Society, 2006. Google Scholar

[2]

F. Asnicar, L. Erculiani, F. Galante, C. Gallo, L. Masera, P. Morettin, N. Sella, S. Semeniuta, T. Tolio, G. Malacarne, K. Engelen, A. Argentini, V. Cavecchia, C. Moser, and E. Blanzieri. Discovering cacomputing.ndidates for gene network expansion by distributed volunteer computing. In *2015 IEEE Trustcom/BigDataSE/ISPA*, volume 3, pages 248–253, 2015. Google Scholar

[3]

Stanley E. Bammel and Jerome Rothstein. The number of 9 × 9 Latin squares. *Discrete Math*., 11(1):93–95, January 1975. CrossrefWeb of ScienceGoogle Scholar

[4]

Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. *Handbook of Satisfiability*, volume 185 of *Frontiers in Artificial Intelligence and Applications*. IOS Press, 2009.Google Scholar

[5]

J.W. Brown, F. Cherry, L. Most, E.T. Parker, and W.D. Wallis. Completion of the spectrum of orthogonal diagonal Latin squares. *Lecture notes in pure and applied mathematics*, 139:43–49, 1992. Google Scholar

[6]

Christophe Cerin and Gilles Fedak. *Desktop Grid Computing*. Chapman & Hall/CRC, 1st edition, 2012. Google Scholar

[7]

Charles J. Colbourn and Jeffrey H. Dinitz. *Handbook of Combinatorial Designs*, *Second Edition (Discrete Mathematics and Its Applications)*. Chapman & Hall/CRC, 2006. Google Scholar

[8]

Judith Egan and Ian M. Wanless. Enumeration of MOLS of small order. *Math*. *Comput*., 85(298):799–824, 2016. Web of ScienceGoogle Scholar

[9]

Ian Foster. *Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering*. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1995. Google Scholar

[10]

Gerasim@home: a volunteer computing project for research in discrete mathematics and logic control, http://gerasim.boinc.ru/.

[11]

Solomon W. Golomb and Leonard D. Baumert. Backtrack programming. *J. ACM*, 12(4):516–524, October 1965. CrossrefGoogle Scholar

[12]

E. Ivashko and A. Golovin. Partition algorithm for association rules mining in boinc-based enterprise desktop grid. *Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, 9251:268–272, 2015. Google Scholar

[13]

N. Khrapov, V. Roizen, M. Posypkin, A. Samtsevich, and A. R. Oganov. Volunteer computing for computational materials design. *Lobachevskii Journal of Mathematics*, 38(5):926–930, Sep 2017. CrossrefWeb of ScienceGoogle Scholar

[14]

Ilya Kurochkin and Anatoliy Saevskiy. BOINC forks, issues and directions of development1 *Procedia Computer Science*, 101(Supplement C):369 – 378, 2016. 5th International Young Scientist Conference on Computational Science, YSC 2016, 26-28 October 2016, Krakow, Poland. Google Scholar

[15]

C.W.H. Lam, L. Thiel, and S. Swierz. The nonexistence of finite projective planes of order 10. *Canad*. *J*. *Math*., 41:1117–1123, 1989. CrossrefGoogle Scholar

[16]

Hung-Hsuan Lin and I-Chen Wu. Solving the minimum Sudoku problem. In *The 2010 International Conference on Technologies and Applications of Artificial Intelligence*, TAAI ’10, pages 456–461, Washington, DC, USA, 2010. IEEE Computer Society. Google Scholar

[17]

Inês Lynce and Joël Ouaknine. Sudoku as a SAT problem. In *International Symposium on Artificial Intelligence and Mathematics*, *ISAIM 2006*, *Fort Lauderdale*, *Florida*, *USA*, *January 4-6*, *2006*, 2006. Google Scholar

[18]

João Marques-Silva, Inês Lynce, and Sharad Malik. Conflict-driven clause learning SAT solvers. In Biere et al. [4], pages 131–153. Google Scholar

[19]

Gary McGuire, Bastian Tugemann, and Gilles Civario. There is no 16-clue Sudoku: Solving the Sudoku minimum number of clues problem via hitting set enumeration. *Experimental Mathematics*, 23(2):190–217, 2014. Web of ScienceCrossrefGoogle Scholar

[20]

Brendan D. McKay, Jeanette C. McLeod, and Ian M. Wanless. The number of transversals in a Latin square. *Designs, Codes and Cryptography*, 40(3):269–284, 2006. CrossrefGoogle Scholar

[21]

Brendan D. McKay, Alison Meynert, and Wendy Myrvold. Small Latin squares, quasigroups, and loops. *Journal of Combinatorial Designs*, 15(2):98–119, 2007. CrossrefGoogle Scholar

[22]

Brendan D. McKay and Eric Rogoyski. Latin squares of order 10. *Electr. J. Comb*., 2(1):1–4,1995. Google Scholar

[23]

Brendan D. McKay and Ian M. Wanless. On the number of Latin squares. *Annals of Combinatorics*, 9(3):335–344, oct 2005. CrossrefGoogle Scholar

[24]

Natalia Nikitina, Evgeny Ivashko, and Andrei Tchernykh. Congestion game scheduling implementation for high-throughput virtual drug screening using boinc-based desktop grid. In Victor Malyshkin, editor, *Parallel Computing Technologies*, pages 480–491, Cham, 2017. Springer International Publishing. Google Scholar

[25]

The on-line encyclopedia of integer sequences (OEIS), https://oeis.org/.

[26]

SAT@home: a volunteer computing project aimed at solving hard SAT instances, http://sat.isa.ru/pdsat/.

[27]

Alexander Semenov and Oleg Zaikin. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. *SpringerPlus*, 5(1):1–16, 2016. Google Scholar

[28]

Takehide Soh, Naoyuki Tamura, and Mutsunori Banbara. Scarab: A rapid prototyping tool for sat-based constraint programming systems. In Matti Järvisalo and Allen Van Gelder, editors, *Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference*, *Helsinki*, *Finland*, *July 8-12*, *2013*. *Proceedings*, volume 7962 of *Lecture Notes in Computer Science*, pages 429–436. Springer, 2013. Google Scholar

[29]

Eduard Vatutin, Stepan Kochemazov, and Oleg Zaikin. Applying volunteer and parallel computing for enumerating diagonal latin squares of order 9. In *Proc. of The Eleventh International Conference on Parallel Computational Technologies*, volume 753 of *Communications in Computer and Information Science*, pages 110–124. Springer, 2017. Google Scholar

[30]

Eduard Vatutin, Sergey Valyaev, and Vitaly Titov. Comparison of sequential methods for getting separations of parallel logic control algorithms using volunteer computing. In *Second International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2015)*, *Petrozavodsk*, *Russia*, *September 14-18, 2015*, volume 1502 of *CEUR-WS*, pages 37–51, 2015. Google Scholar

[31]

Eduard Vatutin, Oleg Zaikin, Alexey Zhuravlev, Maxim Manzyuk, Stepan Kochemazov, and Vitaly Titov. Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares. In *Selected Papers of the 7th International Conference Distributed Computing and Grid-technologies in Science and Education, Dubna, Russia, July 4-9, 2016*, volume 1787 of *CEUR-WS*, pages 486–490, 2016. Google Scholar

[32]

Ian Murray Wanless. *Transversals in latin squares: a survey*, pages 403–437. Cambridge University Press, United Kingdom, 2011. Google Scholar

[33]

Oleg Zaikin and Stepan Kochemazov. The search for systems of diagonal Latin squares using the SAT@home project. *International Journal of Open Information Technologies*, 3(11):4–9, 2015. Google Scholar

[34]

Oleg Zaikin, Maxim Manzyuk, Stepan Kochemazov, Igor Bychkov, and Alexander Semenov. A volunteer-computing-based grid architecture incorporating idle resources of computational clusters. In Ivan Dimov, István Faragó, and Lubin G. Vulkov, editors, *Numerical Analysis and Its Applications - 6th International Conference*, *NAA 2016, Lozenetz, Bulgaria, June 15-22, 2016, Revised Selected Papers*, volume 10187 of *Lecture Notes in Computer Science*, pages 769–776, 2016. Google Scholar

[35]

Oleg Zaikin, Pavel Petrov, Mikhail Posypkin, Vadim Bulavintsev, and Ilya Kurochkin. Using volunteer computing for sound speed profile estimation in underwater acoustics. In *Third International Conference BOINC-based High Performance Computing: Fundamental Research and Development (BOINC:FAST 2017)*. *Petrozavodsk*, *Russia*, *August 28 - September 1*, *2017*, volume 1973 of *CEUR-WS*, pages 43–48, 2017. Google Scholar

[36]

Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, and Eduard Vatutin. On the construction of triples of diagonal Latin squares of order 10. *Electronic Notes in Discrete Mathematics*, 54:307–312, 2016. CrossrefGoogle Scholar

[37]

Hantao Zhang. Combinatorial designs by SAT solvers. In Biere et al. [4], pages 533–568. Google Scholar

## Comments (0)

General note:By using the comment function on degruyter.com you agree to our Privacy Statement. A respectful treatment of one another is important to us. Therefore we would like to draw your attention to our House Rules.