default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander A. Semenov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j5]Alexander A. Semenov
, Kirill Antonov, Stepan Kochemazov, Artem Pavlenko:
Using Linearizing Sets to Solve Multivariate Quadratic Equations in Algebraic Cryptanalysis. IEEE Access 11: 120319-120333 (2023)- 2020
- [j4]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) - 2016
- [j3]Alexander A. Semenov, Ilya V. Otpuschennikov:
On one class of decision diagrams. Autom. Remote. Control. 77(4): 617-628 (2016) - 2012
- [j2]Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin:
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13(1): 25-34 (2012) - 2011
- [j1]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): 2623-2634 (2011)
Conference and Workshop Papers
- 2024
- [c30]Artem Pavlenko, Alexander A. Semenov:
Using Island Model in Asynchronous Evolutionary Strategy to Search for Backdoors for SAT. CEC 2024: 1-7 - [c29]Alexander Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov:
Using Backdoors to Generate Learnt Information in SAT Solving. ECAI 2024: 4173-4180 - [c28]Alexander Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov:
Solving Influence Maximization Problem Under Deterministic Linear Threshold Model Using Metaheuristic optimization. MIPRO 2024: 19-24 - 2023
- [c27]Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi:
Probabilistic Generalization of Backdoor Trees with Application to SAT. AAAI 2023: 4095-4103 - [c26]Victor Kondratiev, Ilya V. Otpuschennikov, Alexander A. Semenov:
Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams. MIPRO 2023: 1021-1026 - [c25]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: 1039-1044 - 2022
- [c24]Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov:
On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI 2022: 10353-10361 - [c23]Artem Pavlenko, Daniil Chivilikhin, Alexander A. Semenov:
Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability. CEC 2022: 1-8 - 2021
- [c22]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: 47:1-47:18 - [c21]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: 111-124 - 2020
- [c20]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev:
Speeding Up CDCL Inference with Duplicate Learnt Clauses. ECAI 2020: 339-346 - [c19]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: 1046-1051 - [c18]Irina Gribanova, Alexander A. Semenov:
Constructing a Set of Weak Values for Full-round MD4 Hash Function. MIPRO 2020: 1212-1217 - 2019
- [c17]Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev:
Evolutionary Computation Techniques for Constructing SAT-Based Attacks in Algebraic Cryptanalysis. EvoApplications 2019: 237-253 - [c16]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: 1121-1125 - [c15]Artem Pavlenko, Alexander A. Semenov, Vladimir Ulyantsev, Oleg Zaikin:
Parallel Framework for Evolutionary Black-box optimization with Application to Algebraic Cryptanalysis. MIPRO 2019: 1144-1149 - [c14]Dmitry Gorbatenko, Alexander A. Semenov, Stepan Kochemazov:
UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs. MIPRO 2019: 1199-1204 - [c13]Alexander A. Semenov:
Merging Variables: One Technique of Search in Pseudo-Boolean Optimization. MOTOR (2) 2019: 86-102 - 2018
- [c12]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. AAAI 2018: 6641-6648 - [c11]Irina Gribanova, Alexander A. Semenov:
Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4. MIPRO 2018: 1174-1179 - 2017
- [c10]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov:
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. MIPRO 2017: 1166-1171 - [c9]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: 1172-1177 - 2016
- [c8]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: 261-275 - [c7]Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov:
Encoding Cryptographic Functions to SAT Using TRANSALG System. ECAI 2016: 1594-1595 - [c6]Oleg Zaikin, Stepan Kochemazov, Alexander A. Semenov:
SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home. MIPRO 2016: 277-281 - [c5]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: 1288-1292 - [c4]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: 769-776 - 2015
- [c3]Alexander A. Semenov, Oleg Zaikin:
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. PaCT 2015: 222-230 - 2011
- [c2]Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin:
Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System. PaCT 2011: 473-483 - [c1]Alexey Ignatiev, Alexander A. Semenov:
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. SAT 2011: 76-89
Informal and Other Publications
- 2023
- [i13]Daniil Chivilikhin, Artem Pavlenko, Alexander A. Semenov:
Decomposing Hard SAT Instances with Metaheuristic Optimization. CoRR abs/2312.10436 (2023) - 2022
- [i12]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 abs/2210.01484 (2022) - 2019
- [i11]Alexander A. Semenov:
Merging variables: one technique of search in pseudo-Boolean optimization. CoRR abs/1908.00751 (2019) - 2018
- [i10]Irina Gribanova, Alexander A. Semenov:
Using Automatic Generation of Relaxation Constraints to Improve the Preimage Attack on 39-step MD4. CoRR abs/1802.06940 (2018) - [i9]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. CoRR abs/1803.04646 (2018) - [i8]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 abs/1805.07239 (2018) - 2016
- [i7]Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov:
Encoding Cryptographic Functions to SAT Using Transalg System. CoRR abs/1607.00888 (2016) - 2015
- [i6]Alexander A. Semenov, Oleg Zaikin:
Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem. CoRR abs/1507.00862 (2015) - 2014
- [i5]Ilya V. Otpuschennikov, Alexander A. Semenov, Stepan Kochemazov:
Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT (Tool Paper). CoRR abs/1405.1544 (2014) - [i4]Stepan Kochemazov, Alexander A. Semenov:
Using synchronous Boolean networks to model several phenomena of collective behavior. CoRR abs/1410.7942 (2014) - [i3]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov:
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks. CoRR abs/1411.5433 (2014) - 2013
- [i2]Alexander A. Semenov, Oleg Zaikin:
On estimating total time to solve SAT in distributed computing environments: Application to the SAT@home project. CoRR abs/1308.0761 (2013) - 2011
- [i1]Alexander A. Semenov, Oleg Zaikin, Dmitry Bespalov, Mikhail Posypkin:
Parallel algorithms for SAT in application to inversion problems of some discrete functions. CoRR abs/1102.3563 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
