{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:16:41Z","timestamp":1725884201331},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319570983"},{"type":"electronic","value":"9783319570990"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57099-0_89","type":"book-chapter","created":{"date-parts":[[2017,4,11]],"date-time":"2017-04-11T14:34:30Z","timestamp":1491921270000},"page":"769-776","source":"Crossref","is-referenced-by-count":3,"title":["A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Zaikin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Manzyuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stepan","family":"Kochemazov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Bychkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Semenov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,4,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Anderson, D.P., Fedak, G.: The computational and storage potential of volunteer computing. In: Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2006), Singapore, 16\u201319 May 2006, pp. 73\u201380. IEEE Computer Society (2006)","key":"89_CR1","DOI":"10.1109\/CCGRID.2006.101"},{"volume-title":"Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications","year":"2009","unstructured":"Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)","key":"89_CR2"},{"doi-asserted-by":"crossref","unstructured":"Brown, J., Cherry, F., Most, L., Parker, E., Wallis, W.: Completion of the spectrum of orthogonal diagonal latin squares. In: Lecture Notes in Pure and Applied Mathematics, vol. 139, pp. 43\u201349 (1992)","key":"89_CR3","DOI":"10.1201\/9780203719916-4"},{"key":"89_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11836810_13","volume-title":"Information Security","author":"C Canni\u00e8re","year":"2006","unstructured":"Canni\u00e8re, C.: Trivium: a stream cipher construction inspired by block cipher design principles. In: Katsikas, S.K., L\u00f3pez, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 171\u2013186. Springer, Heidelberg (2006). doi: 10.1007\/11836810_13"},{"key":"89_CR5","doi-asserted-by":"crossref","DOI":"10.1201\/9781420049954","volume-title":"The CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"1996","unstructured":"Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Inc., Boca Raton (1996)"},{"key":"89_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24605-3_37"},{"key":"89_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-79719-7_7","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"T Eibach","year":"2008","unstructured":"Eibach, T., Pilz, E., V\u00f6lkel, G.: Attacking bivium using SAT solvers. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 63\u201376. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-79719-7_7"},{"key":"89_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0167-739X(95)00035-Q","volume":"12","author":"D Epema","year":"1996","unstructured":"Epema, D., Livny, M., van Dantzig, R., Evers, X., Pruyne, J.: A worldwide flock of condors: load sharing among workstation clusters. Future Gener. Comput. Syst. 12, 53\u201365 (1996)","journal-title":"Future Gener. Comput. Syst."},{"issue":"3","key":"89_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s00450-009-0083-7","volume":"23","author":"Y Evtushenko","year":"2009","unstructured":"Evtushenko, Y., Posypkin, M., Sigal, I.: A framework for parallel large-scale global optimization. Comput. Sci. Res. Dev. 23(3), 211\u2013215 (2009)","journal-title":"Comput. Sci. Res. Dev."},{"issue":"8","key":"89_CR10","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1016\/j.future.2010.05.009","volume":"26","author":"Z Farkas","year":"2010","unstructured":"Farkas, Z., Kacsuk, P., Balaton, Z., Gomb\u00e1s, G.: Interoperability of BOINC and EGEE. Future Gener. Comput. Syst. 26(8), 1092\u20131103 (2010)","journal-title":"Future Gener. Comput. Syst."},{"key":"89_CR11","volume-title":"Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering","author":"I Foster","year":"1995","unstructured":"Foster, I.: Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering. Addison-Wesley Longman Publishing Co., Inc., Boston (1995)"},{"unstructured":"Lynce, I., Ouaknine, J.: Sudoku as a SAT problem. In: International Symposium on Artificial Intelligence and Mathematics (ISAIM 2006), Fort Lauderdale, Florida, USA, 4\u20136 January 2006","key":"89_CR12"},{"key":"89_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-77360-3_3","volume-title":"Selected Areas in Cryptography","author":"A Maximov","year":"2007","unstructured":"Maximov, A., Biryukov, A.: Two trivial attacks on Trivium. In: Adams, C., Miri, A., Wiener, M. (eds.) SAC 2007. LNCS, vol. 4876, pp. 36\u201355. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-77360-3_3"},{"issue":"1","key":"89_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40064-016-2187-4","volume":"5","author":"A Semenov","year":"2016","unstructured":"Semenov, A., Zaikin, O.: Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions. SpringerPlus 5(1), 1\u201316 (2016)","journal-title":"SpringerPlus"},{"unstructured":"Zaikin, O., Kochemazov, S.: The search for systems of diagonal Latin squares using the SAT@home project. In: Second International Conference BOINC-Based High Performance Computing: Fundamental Research and Development (BOINC: FAST 2015), Petrozavodsk, Russia, 14\u201318 September 2015, vol. 1502, pp. 52\u201363. CEUR-WS (2015)","key":"89_CR15"},{"unstructured":"Zaikin, O., Semenov, A., Otpuschennikov, I.: Solving weakened cryptanalysis problems for the Bivium cipher in the volunteer computing project SAT@home. In: Second International Conference BOINC-Based High Performance Computing: Fundamental Research and Development (BOINC: FAST 2015), Petrozavodsk, Russia, 14\u201318 September 2015, vol. 1502, pp. 22\u201330. CEUR-WS (2015)","key":"89_CR16"},{"unstructured":"Zaikin, O., Vatutin, E., Zhuravlev, A., Manzyuk, M.: Applying high-performance computing to searching for triples of partially orthogonal Latin squares of order 10. In: 10th Annual International Scientific Conference on Parallel Computing Technologies, Arkhangelsk, Russia, 29\u201331 March 2016, vol. 1576, pp. 155\u2013166. CEUR-WS (2016)","key":"89_CR17"},{"unstructured":"Zhang, H.: Combinatorial Designs by SAT Solvers, pp. 533\u2013568. In: Biere et al. [2], vol. 185, February 2009","key":"89_CR18"}],"container-title":["Lecture Notes in Computer Science","Numerical Analysis and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57099-0_89","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T09:33:38Z","timestamp":1601890418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57099-0_89"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319570983","9783319570990"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57099-0_89","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}