**Searching for Orthogonal Latin Squares via Cells Mapping and BOINC-Based Cube-and-Conquer**(local copy),*Russian Supercomputing Days 2021***Enumerating the Orthogonal Diagonal Latin Squares of Small Order for Different Types of Orthogonality**,*Russian Supercomputing Days 2020***Replication of "Tail" Computations in a Desktop Grid Project**(local copy),*Russian Supercomputing Days 2020*

This paper was written using statistics gathered in RakeSearch project.**Start-up and the results of the volunteer computing project RakeSearch**(local copy),*Russian Supercomputing Days 2019***On Sharing Workload in Desktop Grids**(local copy),*Russian Supercomputing Days 2018*

- Presentation at the conference Russian Supercomputing Days 2019:
**Start-up and the results of the volunteer computing project RakeSearch**[En] - Presentation at the BOINC Workshop 2018:
**Petrozavodsk Desktop Grid Community**[En] - Presentation at the conference "Optoelectronic Equipment and Devices in Systems of Pattern Recognition, Image and Symbol Information Processing",

Recognition-2018:**Characterizing orthogonal diagonal Latin squares of order 9 discovered in a distributed computing project**[En] - Presentation at the National Supercomputing Forum 2018:
**Start-up and first structures of orthogonal diagonal Latin squares discovered in the volunteer computing project RakeSearch**[Ru] - Presentation at the conference BOINC:FAST 2017:
**ODLS generated by rows permutation**[En] - Presentation at the conference BOINC:FAST 2017:
**ОДЛК, порождаемые перестановкой строк**[Ru]

**A287644**(The maximal number of transversals in a diagonal Latin square of order N; confirmed)**A287645**(The minimal number of transversals in a diagonal Latin square of order N; confirmed)**A287647**(The minimal number of diagonal transversals in a diagonal Latin square of order N; confirmed)**A287648**(The maximal number of diagonal transversals in a diagonal Latin square of order N; confirmed)**A287651**(The number of reduced pairs of orthogonal diagonal Latin squares of order N; updated)**A287695**(The maximal number of normalized diagonal Latin squares that can be orthogonal to the same diagonal Latin square of order N; confirmed)**A287764**(The number of main classes of diagonal Latin squares of order N; rechecked)**A307163**(The minimal number of intercalates in a diagonal Latin square of order N; confirmed)**A307164**(The maximal number of intercalates in a diagonal Latin square of order N; confirmed)**A309210**(The number of main classes of extended self-orthogonal diagonal Latin squares of order N; updated)**A329685**(The number of main classes of self-orthogonal diagonal Latin squares of order N; confirmed)**A330391**(The number of main classes of diagonal Latin squares of order N with at least one orthogonal diagonal mate; updated)**A333366**(The number of main classes of doubly self-orthogonal diagonal Latin squares of order N; confirmed)**A338250**(The number of isomorphism classes of pairs of orthogonal diagonal Latin squares of order N; new)**A339926**(The number of pairs of orthogonal diagonal Latin squares of order N; new)

^{*}Basing on the experiments performed in RakeSearch project,
there were discovered new integer sequences (new),
confirmed previously inexact values (confirmed), and
independently recalculated known values (rechecked).

©2024 The searchers team, Karelian Research Center of the Russian Academy of Sciences