| 2026 | STOC | Strong ETH Holds for Bounded-Depth Resolution over Parities. | Klim Efremenko, Dmitry Itsykson |
| 2025 | STOC | Lifting to Bounded-Depth and Regular Resolutions over Parities via Games. | Yaroslav Alekseev, Dmitry Itsykson |
| 2024 | STOC | Lower Bounds for Regular Resolution over Parities. | Klim Efremenko, Michal Garlk, Dmitry Itsykson |
| 2024 | SAT | On Limits of Symbolic Approach to SAT Solving. | Dmitry Itsykson, Sergei Ovcharov |
| 2022 | MFCS | Automating OBDD proofs is NP-hard. | Dmitry Itsykson, Artur Riazanov |
| 2022 | SAT | Tight Bounds for Tseitin Formulas. | Dmitry Itsykson, Artur Riazanov, Petr Smirnov |
| 2019 | CSR | On Tseitin Formulas, Read-Once Branching Programs and Treewidth. | Ludmila Glinskih, Dmitry Itsykson |
| 2019 | MFCS | Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. | Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova |
| 2017 | MFCS | Satisfiable Tseitin Formulas Are Hard for Nondeterministic Read-Once Branching Programs. | Ludmila Glinskih, Dmitry Itsykson |
| 2017 | STACS | On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. | Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov |
| 2017 | SAT | Hard Satisfiable Formulas for Splittings by Linear Combinations. | Dmitry Itsykson, Alexander Knop |
| 2016 | ISAAC | Complexity of Distributions and Average-Case Hardness. | Dmitry Itsykson, Alexander Knop, Dmitry Sokolov |
| 2016 | MFCS | Computational and Proof Complexity of Partial String Avoidability. | Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin |
| 2015 | CSR | Resolution Complexity of Perfect Matching Principles for Sparse Graphs. | Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov |
| 2015 | ISAAC | Heuristic Time Hierarchies via Hierarchies for Sampling Distributions. | Dmitry Itsykson, Alexander Knop, Dmitry Sokolov |
| 2014 | MFCS | Lower Bounds for Splittings by Linear Combinations. | Dmitry Itsykson, Dmitry Sokolov |
| 2013 | CSR | Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP. | Dmitry Itsykson, Vsevolod Oparin |
| 2011 | CSR | The Complexity of Inversion of Explicit Goldreich's Function by DPLL Algorithms. | Dmitry Itsykson, Dmitry Sokolov |
| 2011 | ISAAC | Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic. | Dmitry Itsykson, Dmitry Sokolov |
| 2010 | CSR | Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms. | Dmitry Itsykson |
| 2010 | STACS | On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. | Edward A. Hirsch, Dmitry Itsykson |
| 2009 | CSR | Structural Complexity of AvgBPP. | Dmitry Itsykson |
| 2008 | WoLLIC | An Infinitely-Often One-Way Function Based on an Average-Case Assumption. | Edward A. Hirsch, Dmitry Itsykson |
| 2006 | ICALP | Lower Bounds of Static Lovsz-Schrijver Calculus Proofs for Tseitin Tautologies. | Arist Kojevnikov, Dmitry Itsykson |
| 2004 | ICALP | Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. | Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson |