default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOleg Zaikin 0002
Person information
- affiliation: Swansea University, UK
- affiliation: Russian Academy of Sciences, Siberian Branch, Matrosov Institute for System Dynamics and Control Theory, Irkutsk, Russia
Other persons with the same name
- Oleg Zaikin 0001 (aka: Oleg A. Zaikin) — Warsaw School of Computer Science, Poland (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j5]Oleg Zaikin
, Stepan Kochemazov:
On black-box optimization in divide-and-conquer SAT solving. Optim. Methods Softw. 36(4): 672-696 (2021)- 2020
- [j4]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) - [j3]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
- [j2]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) - 2012
- [j1]Mikhail Posypkin, Alexander A. Semenov, Oleg Zaikin:
Using BOINC Desktop Grid to Solve Large Scale SAT Problems. Comput. Sci. 13(1): 25-34 (2012)
Conference and Workshop Papers
- 2024
- [c25]Oleg Zaikin:
Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers. CP 2024: 31:1-31:19 - [c24]Stepan Kochemazov, Oleg Zaikin:
Towards Better SAT Encodings for Hash Function Inversion Problems. MIPRO 2024: 25-30 - 2022
- [c23]Oleg Zaikin:
Inverting 43-step MD4 via Cube-and-Conquer. IJCAI 2022: 1894-1900 - 2021
- [c22]Oliver Kullmann, Oleg Zaikin:
Projection Heuristics for Binary Branchings Between Sum and Product. SAT 2021: 299-314 - 2020
- [c21]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov, Victor Kondratiev:
Speeding Up CDCL Inference with Duplicate Learnt Clauses. ECAI 2020: 339-346 - [c20]Oleg Zaikin, Alexey Ignatiev, João Marques-Silva:
Branch Location Problems with Maximum Satisfiability. ECAI 2020: 379-386 - [c19]Oleg Zaikin, Stepan Kochemazov:
Improving Effectiveness of Neighborhood-Based Algorithms for Optimization of Costly Pseudo-Boolean Black-Box Functions. MOTOR 2020: 373-388 - 2019
- [c18]Oleg Zaikin, Ivan Derevitskii, Klavdiya Bochenina, Janusz A. Holyst:
Optimizing Spatial Accessibility of Company Branches Network with Constraints. ICCS (2) 2019: 332-345 - [c17]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 - [c16]Oleg Zaikin, Stepan Kochemazov:
Black-Box Optimization in an Extended Search Space for SAT Solving. MOTOR 2019: 402-417 - [c15]Oleg Zaikin, Anton Petukhov, Klavdiya Bochenina:
Bank Branch Network Optimization Based on Customers Geospatial Profiles. OTM Conferences 2019: 201-208 - [c14]Oleg Zaikin:
SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing. RuSCDays 2019: 701-712 - 2018
- [c13]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. AAAI 2018: 6641-6648 - [c12]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 - [c11]Stepan Kochemazov, Oleg Zaikin:
ALIAS: A Modular Tool for Finding Backdoors for SAT. SAT 2018: 419-427 - 2017
- [c10]Oleg Zaikin, Stepan Kochemazov:
An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator. ISC 2017: 21-38 - [c9]Stepan Kochemazov, Oleg Zaikin, Alexander A. Semenov:
Runtime estimation for enumerating all mutually orthogonal diagonal Latin squares of order 10. MIPRO 2017: 1166-1171 - [c8]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
- [c7]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 - [c6]Ilya V. Otpuschennikov, Alexander A. Semenov, Irina Gribanova, Oleg Zaikin, Stepan Kochemazov:
Encoding Cryptographic Functions to SAT Using TRANSALG System. ECAI 2016: 1594-1595 - [c5]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 - [c4]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 - [c3]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
- [c2]Alexander A. Semenov, Oleg Zaikin:
Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem. PaCT 2015: 222-230 - 2011
- [c1]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
Informal and Other Publications
- 2022
- [i9]Oleg Zaikin:
Inverting Cryptographic Hash Functions via Cube-and-Conquer. CoRR abs/2212.02405 (2022) - 2018
- [i8]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. CoRR abs/1803.04646 (2018) - [i7]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
- [i6]Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin:
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order. CoRR abs/1709.02599 (2017) - 2016
- [i5]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
- [i4]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
- [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-09-02 00:11 CEST 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:
