default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStepan Kochemazov
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)- 2021
- [j4]Oleg Zaikin, Stepan Kochemazov:
On black-box optimization in divide-and-conquer SAT solving. Optim. Methods Softw. 36(4): 672-696 (2021) - 2020
- [j3]Stepan Kochemazov, Oleg Zaikin, Eduard Vatutin, Alexey Belyshev:
Enumerating Diagonal Latin Squares of Order Up to 9. J. Integer Seq. 23(1): 20.1.2 (2020) - [j2]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
- [j1]Oleg Zaikin, Alexey Zhuravlev, Stepan Kochemazov, Eduard Vatutin:
On the Construction of Triples of Diagonal Latin Squares of Order 10. Electron. Notes Discret. Math. 54: 307-312 (2016)
Conference and Workshop Papers
- 2024
- [c25]Alexander Andreev, Konstantin Chukharev, Stepan Kochemazov, Alexander A. Semenov:
Using Backdoors to Generate Learnt Information in SAT Solving. ECAI 2024: 4173-4180 - [c24]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 - [c23]Stepan Kochemazov, Oleg Zaikin:
Towards Better SAT Encodings for Hash Function Inversion Problems. MIPRO 2024: 25-30 - 2023
- [c22]Alexander A. Semenov, Daniil Chivilikhin, Stepan Kochemazov, Ibragim Dzhiblavi:
Probabilistic Generalization of Backdoor Trees with Application to SAT. AAAI 2023: 4095-4103 - [c21]Stepan Kochemazov, Victor Kondratiev, Irina Gribanova:
Empirical Analysis of the RC2 MaxSAT Algorithm. MIPRO 2023: 1027-1032 - [c20]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
- [c19]Alexander A. Semenov, Artem Pavlenko, Daniil Chivilikhin, Stepan Kochemazov:
On Probabilistic Generalization of Backdoors in Boolean Satisfiability. AAAI 2022: 10353-10361 - 2021
- [c18]Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva:
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. SAT 2021: 280-298 - 2020
- [c17]Stepan Kochemazov:
Analysis of comparative effectiveness of state-of-the-art heuristics for CDCL SAT solvers. AICTS 2020: 100-107 - [c16]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev:
Speeding Up CDCL Inference with Duplicate Learnt Clauses. ECAI 2020: 339-346 - [c15]Oleg Zaikin, Stepan Kochemazov:
Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. MOTOR 2020: 373-388 - [c14]Stepan Kochemazov:
Improving Implementation of SAT Competitions 2017-2019 Winners. SAT 2020: 139-148 - 2019
- [c13]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 - [c12]Dmitry Gorbatenko, Alexander A. Semenov, Stepan Kochemazov:
UnProVET: Using Explicit Constraint Propagation to Construct Attack Graphs. MIPRO 2019: 1199-1204 - [c11]Oleg Zaikin, Stepan Kochemazov:
Black-Box Optimization in an Extended Search Space for SAT Solving. MOTOR 2019: 402-417 - 2018
- [c10]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. AAAI 2018: 6641-6648 - [c9]Eduard Vatutin, Alexey Belyshev, Stepan Kochemazov, Oleg Zaikin, Natalia Nikitina:
Enumeration of Isotopy Classes of Diagonal Latin Squares of Small Order Using Volunteer Computing. RuSCDays 2018: 578-586 - [c8]Stepan Kochemazov, Oleg Zaikin:
ALIAS: A Modular Tool for Finding Backdoors for SAT. SAT 2018: 419-427 - 2017
- [c7]Oleg Zaikin, Stepan Kochemazov:
An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. ISC 2017: 21-38 - [c6]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov:
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. MIPRO 2017: 1166-1171 - [c5]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
- [c4]Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov:
Encoding Cryptographic Functions to SAT Using TRANSALG System. ECAI 2016: 1594-1595 - [c3]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 - [c2]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 - [c1]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
Informal and Other Publications
- 2018
- [i6]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. CoRR abs/1803.04646 (2018) - [i5]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) - 2017
- [i4]Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin:
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. CoRR abs/1709.02599 (2017) - 2016
- [i3]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) - 2014
- [i2]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) - [i1]Stepan Kochemazov, Alexander A. Semenov:
Using synchronous Boolean networks to model several phenomena of collective behavior. CoRR abs/1410.7942 (2014)
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:14 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:
