Alexander A. Semenov

Orcid: 0000-0001-6172-4801

According to our database1, Alexander A. Semenov authored at least 42 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solving Influence Maximization Problem Under Deterministic Linear Threshold Model Using Metaheuristic optimization.
Proceedings of the 47th MIPRO ICT and Electronics Convention, 2024

Using Backdoors to Generate Learnt Information in SAT Solving.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT.
Proceedings of the IEEE Congress on Evolutionary Computation, 2024

2023
Decomposing Hard SAT Instances with Metaheuristic Optimization.
CoRR, 2023

Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis.
IEEE Access, 2023

The Study of the Target Set Selection Problem under Deterministic Linear Threshold Model Using Evolutionary Algorithms.
Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams.
Proceedings of the 46th MIPRO ICT and Electronics Convention, 2023

Probabilistic Generalization of Backdoor Trees with Application to SAT.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits.
CoRR, 2022

Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability.
Proceedings of the IEEE Congress on Evolutionary Computation, 2022

On Probabilistic Generalization of Backdoors in Boolean Satisfiability.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to MaxSAT Problem.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

2020
Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems.
Log. Methods Comput. Sci., 2020

Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers.
Proceedings of the 43rd International Convention on Information, 2020

Constructing a Set of Weak Values for Full-round MD4 Hash Function.
Proceedings of the 43rd International Convention on Information, 2020

Speeding Up CDCL Inference with Duplicate Learnt Clauses.
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

2019
Merging Variables: One Technique of Search in Pseudo-Boolean Optimization.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

Computational Study of Time Constrained Influence Maximization Problem under Deterministic Linear Threshold Model for Networks with Nonuniform Thresholds.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs.
Proceedings of the 42nd International Convention on Information and Communication Technology, 2019

Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis.
Proceedings of the Applications of Evolutionary Computation, 2019

2018
Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4.
Proceedings of the 41st International Convention on Information and Communication Technology, 2018

On Cryptographic Attacks Using Backdoors for SAT.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Improving the effectiveness of SAT approach in application to analysis of several discrete models of collective behavior.
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.
Proceedings of the 40th International Convention on Information and Communication Technology, 2017

2016
On one class of decision diagrams.
Autom. Remote. Control., 2016

A Volunteer-Computing-Based Grid Architecture Incorporating Idle Resources of Computational Clusters.
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.
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.
Proceedings of the 39th International Convention on Information and Communication Technology, 2016

Encoding Cryptographic Functions to SAT Using TRANSALG System.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems.
Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

2015
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem.
Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

2014
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks.
CoRR, 2014

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT (Tool Paper).
CoRR, 2014

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

2013
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project.
CoRR, 2013

2012
Using BOINC Desktop Grid to Solve Large Scale SAT Problems.
Comput. Sci., 2012

2011
Estimation of Normalized Atmospheric Point Spread Function and Restoration of Remotely Sensed Images.
IEEE Trans. Geosci. Remote. Sens., 2011

Parallel algorithms for SAT in application to inversion problems of some discrete functions
CoRR, 2011

DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011


  Loading...