Using synchronous Boolean networks to model several phenomena of collective behavior. - Stepan Kochemazov; Alexander A. Semenov (CoRR, 2014)

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT (Tool Paper). - Ilya V. Otpuschennikov; Alexander A. Semenov; Stepan Kochemazov (CoRR, 2014)

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)

UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs. - Dmitry Gorbatenko; Alexander A. Semenov; Stepan Kochemazov (MIPRO, 2019)

Computational Study of Time Constrained Influence Maximization Problem under Deterministic Linear Threshold Model for Networks with Nonuniform Thresholds. - Stepan Kochemazov; Alexander A. Semenov (MIPRO, 2019)

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

Analysis of comparative effectiveness of state-of-the-art heuristics for CDCL SAT solvers. - Stepan Kochemazov (AICTS, 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)

Improving Implementation of SAT Competitions 2017-2019 Winners. - Stepan Kochemazov (SAT, 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)

Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. - Stepan Kochemazov; Alexey Ignatiev; João Marques-Silva 001 (SAT, 2021)

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

On Probabilistic Generalization of Backdoors in Boolean Satisfiability. - Alexander A. Semenov; Artem Pavlenko; Daniil Chivilikhin; Stepan Kochemazov (AAAI, 2022)

Probabilistic Generalization of Backdoor Trees with Application to SAT. - Alexander A. Semenov; Daniil Chivilikhin; Stepan Kochemazov; Ibragim Dzhiblavi (AAAI, 2023)

Empirical Analysis of the RC2 MaxSAT Algorithm. - Stepan Kochemazov; Victor Kondratiev; Irina Gribanova (MIPRO, 2023)

The Study of the Target Set Selection Problem under Deterministic Linear Threshold Model Using Evolutionary Algorithms. - Mikhail Smirnov; Stepan Kochemazov; Alexander A. Semenov (MIPRO, 2023)

Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis. - Alexander A. Semenov; Kirill Antonov; Stepan Kochemazov; Artem Pavlenko (IEEE Access, 2023)

Using Backdoors to Generate Learnt Information in SAT Solving. - Alexander Andreev; Konstantin Chukharev; Stepan Kochemazov; Alexander A. Semenov (ECAI, 2024)

Solving Influence Maximization Problem Under Deterministic Linear Threshold Model Using Metaheuristic optimization. - Alexander Andreev; Konstantin Chukharev; Stepan Kochemazov; Alexander A. Semenov (MIPRO, 2024)

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

Effective Partitioning Method With Predictable Hardness for CircuitSAT. - Konstantin Chukharev; Irina Gribanova; Dmitry Ivanov; Stepan Kochemazov; Victor Kondratiev; Alexander A. Semenov (IEEE Access, 2025)