Stepan Kochemazov

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 33

Top Topics

Boolean Satisfiability

Top Venues

Publications

A. Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov
Solving Influence Maximization Problem Under Deterministic Linear Threshold Model Using Metaheuristic optimization. MIPRO (2024)
Stepan Kochemazov, Oleg Zaikin
Towards Better SAT Encodings for Hash Function Inversion Problems. MIPRO (2024)
Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi
Probabilistic Generalization of Backdoor Trees with Application to SAT. AAAI (2023)
Stepan Kochemazov, Victor Kondratiev, Irina Gribanova
Empirical Analysis of the RC2 MaxSAT Algorithm. MIPRO (2023)
Mikhail Smirnov, Stepan Kochemazov, Alexander A. Semenov
The Study of the Target Set Selection Problem under Deterministic Linear Threshold Model Using Evolutionary Algorithms. MIPRO (2023)
Alexander A. Semenov, Kirill Antonov, Stepan Kochemazov, Artem Pavlenko
Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis. IEEE Access 11 (2023)
Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov
On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI (2022)
Oleg Zaikin, Stepan Kochemazov
On black-box optimization in divide-and-conquer SAT solving. Optim. Methods Softw. 36 (4) (2021)
Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. SAT (2021)
Stepan Kochemazov
Analysis of comparative effectiveness of state-of-the-art heuristics for CDCL SAT solvers. AICTS (2020)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev
Speeding Up CDCL Inference with Duplicate Learnt Clauses. ECAI (2020)
Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. Log. Methods Comput. Sci. 16 (1) (2020)
Stepan Kochemazov
Improving Implementation of SAT Competitions 2017-2019 Winners. SAT (2020)
Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, Alexey Belyshev
Enumerating Diagonal Latin Squares of Order Up to 9. J. Integer Seq. 23 (1) (2020)
Oleg Zaikin, Stepan Kochemazov
Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. MOTOR (2020)
Stepan Kochemazov, Alexander A. Semenov
Computational Study of Time Constrained Influence Maximization Problem under Deterministic Linear Threshold Model for Networks with Nonuniform Thresholds. MIPRO (2019)
Oleg Zaikin, Stepan Kochemazov
Black-Box Optimization in an Extended Search Space for SAT Solving. MOTOR (2019)
Dmitry Gorbatenko, Alexander A. Semenov, Stepan Kochemazov
UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs. MIPRO (2019)
Stepan Kochemazov, Oleg Zaikin
ALIAS: A Modular Tool for Finding Backdoors for SAT. SAT (2018)
Eduard Vatutin, Alexey Belyshev, Stepan Kochemazov, Oleg Zaikin, Natalia Nikitina
Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing. RuSCDays (2018)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. CoRR (2018)
Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems. CoRR (2018)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. AAAI (2018)
Oleg Zaikin, Stepan Kochemazov
An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. ISC (2017)
Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. CoRR (2017)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. MIPRO (2017)
Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov
Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior. MIPRO (2017)
Stepan Kochemazov, Alexander A. Semenov, Oleg Zaikin
The application of parameterized algorithms for solving SAT to the study of several discrete models of collective behavior. MIPRO (2016)
Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Encoding Cryptographic Functions to SAT Using Transalg System. CoRR (2016)
Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov
Encoding Cryptographic Functions to SAT Using TRANSALG System. ECAI (2016)
Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, Eduard Vatutin
On the Construction of Triples of Diagonal Latin Squares of Order 10. Electron. Notes Discret. Math. 54 (2016)
Oleg Zaikin, Maxim Manzyuk, Stepan Kochemazov, Igor V. Bychkov, Alexander A. Semenov
A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters. NAA (2016)
Oleg Zaikin, Stepan Kochemazov, Alexander A. Semenov
SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home. MIPRO (2016)
Stepan Kochemazov, Alexander A. Semenov
Using synchronous Boolean networks to model several phenomena of collective behavior. CoRR (2014)
Ilya V. Otpuschennikov, Alexander A. Semenov, Stepan Kochemazov
Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT (Tool Paper). CoRR (2014)