default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitry Itsykson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Dmitry Itsykson, Sergei Ovcharov:
On Limits of Symbolic Approach to SAT Solving. SAT 2024: 19:1-19:22- [c24]Klim Efremenko
, Michal Garlík, Dmitry Itsykson:
Lower Bounds for Regular Resolution over Parities. STOC 2024: 640-651 - [i23]Yaroslav Alekseev, Dmitry Itsykson:
Lifting to regular resolution over parities via games. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j15]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Ann. Pure Appl. Log. 174(1): 103166 (2023) - [i22]Klim Efremenko, Michal Garlík, Dmitry Itsykson:
Lower bounds for regular resolution over parities. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c23]Dmitry Itsykson, Artur Riazanov:
Automating OBDD proofs is NP-hard. MFCS 2022: 59:1-59:15 - [c22]Dmitry Itsykson, Artur Riazanov, Petr Smirnov:
Tight Bounds for Tseitin Formulas. SAT 2022: 6:1-6:21 - [i21]Dmitry Itsykson, Artur Riazanov:
Automating OBDD proofs is NP-hard. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j14]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 13 (2021) - [j13]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Comput. Complex. 30(2): 16 (2021) - [j12]Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. Theory Comput. Syst. 65(3): 613-633 (2021) - [j11]Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22(4): 26:1-26:30 (2021) - [j10]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021) - [c21]Dmitry Itsykson, Artur Riazanov:
Proof Complexity of Natural Formulas via Communication Arguments. CCC 2021: 3:1-3:34 - 2020
- [j9]Dmitry Itsykson, Dmitry Sokolov:
Resolution over linear equations modulo two. Ann. Pure Appl. Log. 171(1) (2020) - [j8]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. J. Symb. Log. 85(2): 632-670 (2020) - [i20]Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. TR20 (2020) - [i19]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and proof complexity of partial string avoidability. Electron. Colloquium Comput. Complex. TR20 (2020) - [i18]Dmitry Itsykson, Artur Riazanov:
Proof complexity of natural formulas via communication arguments. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c20]Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. CSR 2019: 143-155 - [c19]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. MFCS 2019: 49:1-49:15 - [i17]Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i16]Ludmila Glinskih, Dmitry Itsykson:
On Tseitin formulas, read-once branching programs and treewidth. Electron. Colloquium Comput. Complex. TR19 (2019) - [i15]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based algorithms and proof systems that dynamically change order of variables. Electron. Colloquium Comput. Complex. TR19 (2019) - [i14]Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c18]Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. CCC 2018: 16:1-16:24 - [i13]Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c17]Ludmila Glinskih, Dmitry Itsykson:
Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. MFCS 2017: 26:1-26:12 - [c16]Dmitry Itsykson, Alexander Knop:
Hard Satisfiable Formulas for Splittings by Linear Combinations. SAT 2017: 53-61 - [c15]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS 2017: 43:1-43:14 - [i12]Dmitry Itsykson, Alexander Knop:
Hard satisfiable formulas for splittings by linear combinations. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j7]Dmitry Itsykson, Vsevolod Oparin, Mikhail Slabodkin, Dmitry Sokolov:
Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles. Fundam. Informaticae 145(3): 229-242 (2016) - [c14]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of Distributions and Average-Case Hardness. ISAAC 2016: 38:1-38:12 - [c13]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. MFCS 2016: 51:1-51:13 - 2015
- [c12]Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov:
Resolution Complexity of Perfect Matching Principles for Sparse Graphs. CSR 2015: 219-230 - [c11]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions. ISAAC 2015: 201-211 - [i11]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of distributions and average-case hardness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j6]Dmitry Itsykson, Dmitry Sokolov:
On Fast Heuristic Non-deterministic Algorithms and Short Heuristic Proofs. Fundam. Informaticae 132(1): 113-129 (2014) - [j5]Dmitry Itsykson:
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. Theory Comput. Syst. 54(2): 261-276 (2014) - [c10]Dmitry Itsykson, Dmitry Sokolov:
Lower Bounds for Splittings by Linear Combinations. MFCS (2) 2014: 372-383 - [i10]Dmitry Itsykson, Anna Malova, Vsevolod Oparin, Dmitry Sokolov:
Tree-like resolution complexity of two planar problems. CoRR abs/1412.1124 (2014) - [i9]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Heuristic time hierarchies via hierarchies for sampling distributions. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov:
Resolution complexity of perfect mathcing principles for sparse graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c9]Dmitry Itsykson, Vsevolod Oparin:
Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. CSR 2013: 162-173 - 2012
- [j4]Edward A. Hirsch, Dmitry Itsykson:
On an optimal randomized acceptor for graph nonisomorphism. Inf. Process. Lett. 112(5): 166-171 (2012) - [j3]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography. Theory Comput. Syst. 51(2): 179-195 (2012) - [i7]Dmitry Itsykson, Dmitry Sokolov:
Lower bounds for myopic DPLL algorithms with a cut heuristic. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [c8]Dmitry Itsykson, Dmitry Sokolov:
The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms. CSR 2011: 134-147 - [c7]Dmitry Itsykson, Dmitry Sokolov:
Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic. ISAAC 2011: 464-473 - [i6]Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolaenko, Alexander Smal:
Optimal heuristic algorithms for the image of an injective function. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j2]Dmitry Itsykson:
Structural complexity of AvgBPP. Ann. Pure Appl. Log. 162(3): 213-223 (2010) - [c6]Dmitry Itsykson:
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. CSR 2010: 204-215 - [c5]Edward A. Hirsch, Dmitry Itsykson:
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. STACS 2010: 453-464 - [i5]Edward A. Hirsch, Dmitry Itsykson, Ivan Monakhov, Alexander Smal:
On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c4]Dmitry Itsykson:
Structural Complexity of AvgBPP. CSR 2009: 155-166 - [i4]Edward A. Hirsch, Dmitry Itsykson:
On optimal heuristic randomized semidecision procedures, with application to proof complexity. CoRR abs/0908.2707 (2009) - 2008
- [c3]Edward A. Hirsch, Dmitry Itsykson:
An Infinitely-Often One-Way Function Based on an Average-Case Assumption. WoLLIC 2008: 208-217 - [i3]Dmitry Itsykson:
Structural complexity of AvgBPP. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Edward A. Hirsch, Dmitry Itsykson:
An infinitely-often one-way function based on an average-case assumption. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Arist Kojevnikov, Dmitry Itsykson:
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies. ICALP (1) 2006: 323-334 - 2005
- [j1]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. J. Autom. Reason. 35(1-3): 51-72 (2005) - 2004
- [c1]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. ICALP 2004: 84-96 - [i1]Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson:
Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. Electron. Colloquium Comput. Complex. TR04 (2004)
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-05 01:12 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:
