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

DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. - Alexey Ignatiev; Alexander A. Semenov (SAT, 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)

Estimation of Normalized Atmospheric Point Spread Function and Restoration of Remotely Sensed Images. - Alexander A. Semenov; Alexander V. Moshkov; Victor N. Pozhidayev; Alessandro Barducci; Paolo Marcoionni; Ivan Pippi (IEEE Trans. Geosci. Remote. Sens., 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 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)

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 one class of decision diagrams. - Alexander A. Semenov; Ilya V. Otpuschennikov (Autom. Remote. Control., 2016)

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)

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

Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4. - Irina Gribanova; Alexander A. Semenov (MIPRO, 2018)

Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis. - Artem Pavlenko; Alexander A. Semenov; Vladimir Ulyantsev (EvoApplications, 2019)

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)

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

Merging Variables: One Technique of Search in Pseudo-Boolean Optimization. - Alexander A. Semenov (MOTOR (2), 2019)

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

Constructing a Set of Weak Values for Full-round MD4 Hash Function. - Irina Gribanova; Alexander A. Semenov (MIPRO, 2020)

Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers. - Victor Kondratiev; Ilya V. Otpuschennikov; Alexander A. Semenov (MIPRO, 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)

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. - Alexander A. Semenov; Daniil Chivilikhin; Artem Pavlenko; Ilya V. Otpuschennikov; Vladimir Ulyantsev; Alexey Ignatiev (CP, 2021)

On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem. - Alexander A. Semenov; Ilya V. Otpuschennikov; Kirill Antonov (MOTOR, 2021)

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

Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability. - Artem Pavlenko; Daniil Chivilikhin; Alexander A. Semenov (CEC, 2022)

Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits. - Alexander A. Semenov; Konstantin Chukharev; Egor Tarasov; Daniil Chivilikhin; Viktor Kondratiev (CoRR, 2022)

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

Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams. - Victor Kondratiev; Ilya V. Otpuschennikov; Alexander A. Semenov (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)

Decomposing Hard SAT Instances with Metaheuristic Optimization. - Daniil Chivilikhin; Artem Pavlenko; Alexander A. Semenov (CoRR, 2023)

Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT. - Artem Pavlenko; Alexander A. Semenov (CEC, 2024)

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)

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