Stepan Kochemazov

According to our database, Stepan Kochemazov authored at least 33 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Towards Better SAT Encodings for Hash Function Inversion Problems.

Stepan Kochemazov, Oleg Zaikin

Proceedings of the 47th MIPRO ICT and Electronics Convention, 2024

Solving Influence Maximization Problem Under Deterministic Linear Threshold Model Using Metaheuristic optimization.

Alexander Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov

Proceedings of the 47th MIPRO ICT and Electronics Convention, 2024

Using Backdoors to Generate Learnt Information in SAT Solving.

Alexander Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis.

Alexander A. Semenov, Kirill Antonov, Stepan Kochemazov, Artem Pavlenko

IEEE Access, 2023

The Study of the Target Set Selection Problem under Deterministic Linear Threshold Model Using Evolutionary Algorithms.

Mikhail Smirnov, Stepan Kochemazov, Alexander A. Semenov

Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

Empirical Analysis of the RC2 MaxSAT Algorithm.

Stepan Kochemazov, Victor Kondratiev, Irina Gribanova

Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

Probabilistic Generalization of Backdoor Trees with Application to SAT.

Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

On Probabilistic Generalization of Backdoors in Boolean Satisfiability.

Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

On black-box optimization in divide-and-conquer SAT solving.

Oleg Zaikin, Stepan Kochemazov

Optim. Methods Softw., 2021

Assessing Progress in SAT Solvers Through the Lens of Incremental SAT.

Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva

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.

Alexander A. Semenov, Ilya V. Otpuschennikov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov

Log. Methods Comput. Sci., 2020

Enumerating Diagonal Latin Squares of Order Up to 9.

Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, Alexey Belyshev

J. Integer Seq., 2020

Improving Implementation of SAT Competitions 2017-2019 Winners.

Stepan Kochemazov

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions.

Oleg Zaikin, Stepan Kochemazov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

Speeding Up CDCL Inference with Duplicate Learnt Clauses.

Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev

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

Analysis of comparative effectiveness of state-of-the-art heuristics for CDCL SAT solvers.

Stepan Kochemazov

Proceedings of the 1st International Workshop on Advanced Information and Computation Technologies and Systems, 2020

2019

Black-Box Optimization in an Extended Search Space for SAT Solving.

Oleg Zaikin, Stepan Kochemazov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Computational Study of Time Constrained Influence Maximization Problem under Deterministic Linear Threshold Model for Networks with Nonuniform Thresholds.

Stepan Kochemazov, Alexander A. Semenov

Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs.

Dmitry Gorbatenko, Alexander A. Semenov, Stepan Kochemazov

Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

2018

ALIAS: A Modular Tool for Finding Backdoors for SAT.

Stepan Kochemazov, Oleg Zaikin

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.

Eduard Vatutin, Alexey Belyshev, Stepan Kochemazov, Oleg Zaikin, Natalia Nikitina

Proceedings of the Supercomputing, 2018

On Cryptographic Attacks Using Backdoors for SAT.

Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order.

Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin

CoRR, 2017

Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior.

Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov

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.

Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov

Proceedings of the 40th International Convention on Information and Communication Technology, 2017

An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator.

Oleg Zaikin, Stepan Kochemazov

Proceedings of the Information Security - 20th International Conference, 2017

2016

On the Construction of Triples of Diagonal Latin Squares of Order 10.

Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, Eduard Vatutin

Electron. Notes Discret. Math., 2016

A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters.

Oleg Zaikin, Maxim Manzyuk, Stepan Kochemazov, Igor V. Bychkov, Alexander A. Semenov

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.

Oleg Zaikin, Stepan Kochemazov, Alexander A. Semenov

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.

Stepan Kochemazov, Alexander A. Semenov, Oleg Zaikin

Proceedings of the 39th International Convention on Information and Communication Technology, 2016

Encoding Cryptographic Functions to SAT Using TRANSALG System.

Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

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

Using synchronous Boolean networks to model several phenomena of collective behavior.

Stepan Kochemazov, Alexander A. Semenov

CoRR, 2014