Alexander A. Semenov

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 36

Top Topics

Boolean Satisfiability

Evolutionary Algorithm

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)
Artem Pavlenko, Alexander A. Semenov
Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT. CEC (2024)
Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi
Probabilistic Generalization of Backdoor Trees with Application to SAT. AAAI (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)
Victor Kondratiev, Ilya V. Otpuschennikov, Alexander A. Semenov
Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams. MIPRO (2023)
Daniil Chivilikhin, Artem Pavlenko, Alexander A. Semenov
Decomposing Hard SAT Instances with Metaheuristic Optimization. CoRR (2023)
Alexander A. Semenov, Konstantin Chukharev, Egor Tarasov, Daniil Chivilikhin, Viktor Kondratiev
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits. CoRR (2022)
Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov
On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI (2022)
Artem Pavlenko, Daniil Chivilikhin, Alexander A. Semenov
Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability. CEC (2022)
Alexander A. Semenov, Ilya V. Otpuschennikov, Kirill Antonov
On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem. MOTOR (2021)
Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. CP (2021)
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)
Irina Gribanova, Alexander A. Semenov
Constructing a Set of Weak Values for Full-round MD4 Hash Function. MIPRO (2020)
Victor Kondratiev, Ilya V. Otpuschennikov, Alexander A. Semenov
Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers. MIPRO (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)
Alexander A. Semenov
Merging variables: one technique of search in pseudo-Boolean optimization. CoRR (2019)
Alexander A. Semenov
Merging Variables: One Technique of Search in Pseudo-Boolean Optimization. MOTOR (2) (2019)
Dmitry Gorbatenko, Alexander A. Semenov, Stepan Kochemazov
UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs. MIPRO (2019)
Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev, Oleg Zaikin
Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. MIPRO (2019)
Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev
Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis. EvoApplications (2019)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. CoRR (2018)
Irina Gribanova, Alexander A. Semenov
Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4. MIPRO (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)
Irina Gribanova, Alexander A. Semenov
Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4. CoRR (2018)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev
On Cryptographic Attacks Using Backdoors for SAT. AAAI (2018)
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)
Alexander A. Semenov, Oleg Zaikin
On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems. DOOR (Supplement) (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, 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)
Alexander A. Semenov, Ilya V. Otpuschennikov
On one class of decision diagrams. Autom. Remote. Control. 77 (4) (2016)
Alexander A. Semenov, Oleg Zaikin
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. PaCT (2015)
Alexander A. Semenov, Oleg Zaikin
Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem. CoRR (2015)
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)
Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. CoRR (2014)
Alexander A. Semenov, Oleg Zaikin
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. CoRR (2013)
Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13 (1) (2012)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. PaCT (2011)
Alexander A. Semenov, Alexander V. Moshkov, Victor N. Pozhidayev, Alessandro Barducci, Paolo Marcoionni, Ivan Pippi
Estimation of Normalized Atmospheric Point Spread Function and Restoration of Remotely Sensed Images. IEEE Trans. Geosci. Remote. Sens. 49 (7) (2011)
Alexey Ignatiev, Alexander A. Semenov
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. SAT (2011)
Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin
Parallel algorithms for SAT in application to inversion problems of some discrete functions CoRR (2011)