Oleg Zaikin
Orcid: 0000-0002-0145-5010Affiliations:
- Swansea University, UK
- Russian Academy of Sciences, Siberian Branch, Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia
According to our database1,
Oleg Zaikin
authored at least 33 papers
between 2011 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on scopus.com
-
on orcid.org
On csauthors.net:
Bibliography
2022
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022
2021
Optim. Methods Softw., 2021
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021
2020
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems.
Log. Methods Comput. Sci., 2020
Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020
2019
Proceedings of the Supercomputing, 2019
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2019 Conferences, 2019
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019
Proceedings of the Computational Science - ICCS 2019, 2019
2018
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018
Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing.
Proceedings of the Supercomputing, 2018
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2017
Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior.
Proceedings of the 40th International Convention on Information and Communication Technology, 2017
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10.
Proceedings of the 40th International Convention on Information and Communication Technology, 2017
Proceedings of the Information Security - 20th International Conference, 2017
2016
Electron. Notes Discret. Math., 2016
A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters.
Proceedings of the Numerical Analysis and Its Applications - 6th International Conference, 2016
SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home.
Proceedings of the 39th International Convention on Information and Communication Technology, 2016
The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior.
Proceedings of the 39th International Convention on Information and Communication Technology, 2016
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016
2015
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem.
Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015
2014
2013
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project.
CoRR, 2013
2012
2011
Parallel algorithms for SAT in application to inversion problems of some discrete functions
CoRR, 2011
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011