Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. - Alexander A. Semenov; Oleg Zaikin 002; Dmitry Bespalov; Mikhail Posypkin (PaCT, 2011)

Parallel algorithms for SAT in application to inversion problems of some discrete functions - Alexander A. Semenov; Oleg Zaikin 002; Dmitry Bespalov; Mikhail Posypkin (CoRR, 2011)

Using BOINC Desktop Grid to Solve Large Scale SAT Problems. - Mikhail Posypkin; Alexander A. Semenov; Oleg Zaikin 002 (Comput. Sci., 2012)

On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. - Alexander A. Semenov; Oleg Zaikin 002 (CoRR, 2013)

Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. - Alexander A. Semenov; Oleg Zaikin 002; Ilya V. Otpuschennikov (CoRR, 2014)

Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. - Alexander A. Semenov; Oleg Zaikin 002 (PaCT, 2015)

On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems. - Alexander A. Semenov; Oleg Zaikin 002 (DOOR (Supplement), 2016)

Encoding Cryptographic Functions to SAT Using TRANSALG System. - Ilya V. Otpuschennikov; Alexander A. Semenov; Irina Gribanova; Oleg Zaikin 002; Stepan Kochemazov (ECAI, 2016)

The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior. - Stepan Kochemazov; Alexander A. Semenov; Oleg Zaikin 002 (MIPRO, 2016)

SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home. - Oleg Zaikin 002; Stepan Kochemazov; Alexander A. Semenov (MIPRO, 2016)

A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters. - Oleg Zaikin 002; Maxim Manzyuk; Stepan Kochemazov; Igor V. Bychkov; Alexander A. Semenov (NAA, 2016)

On the Construction of Triples of Diagonal Latin Squares of Order 10. - Oleg Zaikin 002; Alexey Zhuravlev; Stepan Kochemazov; Eduard Vatutin (Electron. Notes Discret. Math., 2016)

An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. - Oleg Zaikin 002; Stepan Kochemazov (ISC, 2017)

Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. - Stepan Kochemazov; Oleg Zaikin 002; Alexander A. Semenov (MIPRO, 2017)

Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior. - Stepan Kochemazov; Oleg Zaikin 002; Alexander A. Semenov (MIPRO, 2017)

Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. - Stepan Kochemazov; Eduard Vatutin; Oleg Zaikin 002 (CoRR, 2017)

On Cryptographic Attacks Using Backdoors for SAT. - Alexander A. Semenov; Oleg Zaikin 002; Ilya V. Otpuschennikov; Stepan Kochemazov; Alexey Ignatiev (AAAI, 2018)

Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing. - Eduard Vatutin; Alexey Belyshev; Stepan Kochemazov; Oleg Zaikin 002; Natalia Nikitina (RuSCDays, 2018)

ALIAS: A Modular Tool for Finding Backdoors for SAT. - Stepan Kochemazov; Oleg Zaikin 002 (SAT, 2018)

Optimizing Spatial Accessibility of Company Branches Network with Constraints. - Oleg Zaikin 002; Ivan Derevitskii; Klavdiya Bochenina; Janusz A. Holyst (ICCS (2), 2019)

Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. - Artem Pavlenko; Alexander A. Semenov; Vladimir Ulyantsev; Oleg Zaikin 002 (MIPRO, 2019)

Black-Box Optimization in an Extended Search Space for SAT Solving. - Oleg Zaikin 002; Stepan Kochemazov (MOTOR, 2019)

Bank Branch Network Optimization Based on Customers Geospatial Profiles. - Oleg Zaikin 002; Anton Petukhov; Klavdiya Bochenina (OTM Conferences, 2019)

SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing. - Oleg Zaikin 002 (RuSCDays, 2019)

Branch Location Problems with Maximum Satisfiability. - Oleg Zaikin 002; Alexey Ignatiev; João Marques-Silva 001 (ECAI, 2020)

Speeding Up CDCL Inference with Duplicate Learnt Clauses. - Stepan Kochemazov; Oleg Zaikin 002; Alexander A. Semenov; Victor Kondratiev (ECAI, 2020)

Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. - Oleg Zaikin 002; Stepan Kochemazov (MOTOR, 2020)

Enumerating Diagonal Latin Squares of Order Up to 9. - Stepan Kochemazov; Oleg Zaikin 002; Eduard Vatutin; Alexey Belyshev (J. Integer Seq., 2020)

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. - Alexander A. Semenov; Ilya V. Otpuschennikov; Irina Gribanova; Oleg Zaikin 002; Stepan Kochemazov (Log. Methods Comput. Sci., 2020)

Projection Heuristics for Binary Branchings Between Sum and Product. - Oliver Kullmann; Oleg Zaikin 002 (SAT, 2021)

On black-box optimization in divide-and-conquer SAT solving. - Oleg Zaikin 002; Stepan Kochemazov (Optim. Methods Softw., 2021)

Inverting 43-step MD4 via Cube-and-Conquer. - Oleg Zaikin 002 (IJCAI, 2022)

Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers. - Oleg Zaikin 002 (CP, 2024)

Towards Better SAT Encodings for Hash Function Inversion Problems. - Stepan Kochemazov; Oleg Zaikin 002 (MIPRO, 2024)

Inverting Cryptographic Hash Functions via Cube-and-Conquer. - Oleg Zaikin 002 (J. Artif. Intell. Res., 2024)