Artem Pavlenko

Orcid: 0000-0002-3812-4880

According to our database1, Artem Pavlenko authored at least 8 papers between 2019 and 2023.

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

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

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

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
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

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

Fitness comparison by statistical testing in construction of SAT-based guess-and-determine cryptographic attacks.
Proceedings of the Genetic and Evolutionary Computation Conference, 2019

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


  Loading...