{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T20:55:29Z","timestamp":1764276929922,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030058067"},{"type":"electronic","value":"9783030058074"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-05807-4_49","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T04:02:46Z","timestamp":1546228966000},"page":"578-586","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing"],"prefix":"10.1007","author":[{"given":"Eduard","family":"Vatutin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexey","family":"Belyshev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stepan","family":"Kochemazov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Zaikin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia","family":"Nikitina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"49_CR1","unstructured":"Sloane, N.: The on-line encyclopedia of integer sequences. https:\/\/oeis.org\/"},{"key":"49_CR2","series-title":"Discrete Mathematics and Its Applications","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1201\/9781420010541.pt3","volume-title":"Handbook of Combinatorial Designs","author":"C Colbourn","year":"2006","unstructured":"Colbourn, C., et al.: Handbook of Combinatorial Designs. Discrete Mathematics and Its Applications, 2nd edn, pp. 224\u2013265. Chapman and Hall\/CRC, London (2006). chap. Latin Squares","edition":"2"},{"issue":"298","key":"49_CR3","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1090\/mcom\/3010","volume":"85","author":"J Egan","year":"2016","unstructured":"Egan, J., Wanless, I.M.: Enumeration of MOLS of small order. Math. Comput. 85(298), 799\u2013824 (2016)","journal-title":"Math. Comput."},{"issue":"2","key":"49_CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1080\/10586458.2013.870056","volume":"23","author":"G McGuire","year":"2014","unstructured":"McGuire, G., Tugemann, B., Civario, G.: There is no 16-clue Sudoku: solving the Sudoku minimum number of clues problem via hitting set enumeration. Exp. Math. 23(2), 190\u2013217 (2014)","journal-title":"Exp. Math."},{"key":"49_CR5","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-67035-5_9","volume-title":"Parallel Computational Technologies","author":"EI Vatutin","year":"2017","unstructured":"Vatutin, E.I., Kochemazov, S.E., Zaikin, O.S.: Applying volunteer and parallel computing for enumerating diagonal Latin squares of order 9. In: Sokolinsky, L., Zymbler, M. (eds.) PCT 2017. CCIS, vol. 753, pp. 114\u2013129. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67035-5_9"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Vatutin, E., Zaikin, O., Zhuravlev, A., Manzyuk, M., Kochemazov, S., Titov, V.S.: Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares. In: CEUR Workshop Proceedings, Selected papers of the 7th International Conference on Distributed Computing and Grid-Technologies in Science and Education, vol. 1787, pp. 486\u2013490 (2017)","DOI":"10.1515\/eng-2017-0052"},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1515\/eng-2017-0052","volume":"7","author":"E Vatutin","year":"2017","unstructured":"Vatutin, E., Zaikin, O., Kochemazov, S., Valyaev, S.: Using volunteer computing to study some features of diagonal Latin squares. Open Eng. 7, 453\u2013460 (2017)","journal-title":"Open Eng."},{"key":"49_CR8","volume-title":"The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures across Dimensions","author":"CA Pickover","year":"2002","unstructured":"Pickover, C.A.: The Zen of Magic Squares, Circles, and Stars: An Exhibition of Surprising Structures across Dimensions. Princeton University Press, Princeton (2002)"},{"issue":"274","key":"49_CR9","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1090\/S0025-5718-2010-02420-2","volume":"80","author":"A Hulpke","year":"2011","unstructured":"Hulpke, A., Kaski, P., \u00d6sterg\u00e1rd, P.: The number of Latin squares of order 11. Math. Comput. 80(274), 1197\u20131219 (2011)","journal-title":"Math. Comput."},{"issue":"1","key":"49_CR10","first-page":"1","volume":"2","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Rogoyski, E.: Latin squares of order 10. Electr. J. Comb. 2(1), 1\u20134 (1995)","journal-title":"Electr. J. Comb."},{"issue":"3","key":"49_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s00026-005-0261-7","volume":"9","author":"BD McKay","year":"2005","unstructured":"McKay, B.D., Wanless, I.M.: On the number of Latin squares. Ann. Comb. 9(3), 335\u2013344 (2005)","journal-title":"Ann. Comb."},{"issue":"8","key":"49_CR12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1145\/368637.368660","volume":"5","author":"HF Trotter","year":"1962","unstructured":"Trotter, H.F.: Algorithm 115: perm. Commun. ACM 5(8), 434\u2013435 (1962)","journal-title":"Commun. ACM"},{"key":"49_CR13","unstructured":"Vatutin, E., Valyaev, S., Titov, V.: 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\u201318, 2015, vol. 1502, pp. 37\u201351. CEUR-WS (2015)"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Brown, J., Cherry, F., Most, L., Parker, E., Wallis, W.: Completion of the spectrum of orthogonal diagonal Latin squares. Lecture Notes in Pure and Applied Mathematics, vol. 139, pp. 43\u201349 (1992)","DOI":"10.1201\/9780203719916-4"},{"key":"49_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.endm.2016.09.053","volume":"54","author":"O Zaikin","year":"2016","unstructured":"Zaikin, O., Zhuravlev, A., Kochemazov, S., Vatutin, E.: On the construction of triples of diagonal Latin squares of order 10. Electron. Notes Discrete Math. 54, 307\u2013312 (2016)","journal-title":"Electron. Notes Discrete Math."}],"container-title":["Communications in Computer and Information Science","Supercomputing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05807-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T04:47:37Z","timestamp":1605934057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05807-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030058067","9783030058074"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05807-4_49","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"RuSCDays","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russian Supercomputing Days","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ruscdays2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/russianscdays.org\/en","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}