| Bounded-depth Frege complexity of Tseitin formulas for all graphs N Galesi, D Itsykson, A Riazanov, A Sofronova Annals of Pure and Applied Logic 174 (1), 103166, 2023 | 16* | 2023 |
| Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs D Itsykson, A Riazanov, D Sagunov, P Smirnov computational complexity 30 (2), 13, 2021 | 7* | 2021 |
| Proof complexity of natural formulas via communication arguments D Itsykson, A Riazanov 36th Computational Complexity Conference (CCC 2021), 2021 | 5 | 2021 |
| Lower Bounds on OBDD Proofs with Several Orders S Buss, D Itsykson, A Knop, A Riazanov, D Sokolov ACM Transactions on Computational Logic (TOCL) 22 (4), 1-30, 2021 | 4 | 2021 |
| Sampling and Certifying Symmetric Functions Y Filmus, I Leigh, A Riazanov, D Sokolov arXiv preprint arXiv:2305.04363, 2023 | 1 | 2023 |
| Proving Unsatisfiability with Hitting Formulas Y Filmus, EA Hirsch, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2302.06241, 2023 | 1 | 2023 |
| Irreducible subcube partitions Y Filmus, E Hirsch, S Kurz, F Ihringer, A Riazanov, A Smal, M Vinyals arXiv preprint arXiv:2212.14685, 2022 | 1 | 2022 |
| Automating OBDD proofs is NP-hard D Itsykson, A Riazanov 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | 1 | 2022 |
| Tight Bounds for Tseitin Formulas D Itsykson, A Riazanov, P Smirnov 25th International Conference on Theory and Applications of Satisfiability …, 2022 | 1 | 2022 |
| Top-Down Lower Bounds for Depth-Four Circuits M Göös, A Riazanov, A Sofronova, D Sokolov arXiv preprint arXiv:2304.02555, 2023 | | 2023 |
| MCSP is Hard for Read-Once Nondeterministic Branching Programs L Glinskih, A Riazanov Latin American Symposium on Theoretical Informatics, 626-640, 2022 | | 2022 |
| On the decision trees with symmetries A Riazanov International Computer Science Symposium in Russia, 282-294, 2018 | | 2018 |
Dmitry ItsyksonSteklov Institute of Mathematics at St. PetersburgVerified email at pdmi.ras.ru
