| On obdd-based algorithms and proof systems that dynamically change the order of variables D Itsykson, A Knop, A Romashchenko, D Sokolov The Journal of Symbolic Logic 85 (2), 632-670, 2020 | 25 | 2020 |
| Reordering rule makes OBDD proof systems stronger S Buss, D Itsykson, A Knop, D Sokolov 33rd Computational Complexity Conference (CCC 2018), 2018 | 22 | 2018 |
| Strategies for stable merge sorting S Buss, A Knop Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 18 | 2019 |
| Log-rank and lifting for AND-functions A Knop, S Lovett, S McGuire, W Yuan Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 14 | 2021 |
| On the limits of gate elimination A Golovnev, EA Hirsch, A Knop, AS Kulikov Journal of Computer and System Sciences 96, 107-119, 2018 | 13 | 2018 |
| IPS-like Proof Systems Based on Binary Decision Diagrams. A Knop Electron. Colloquium Comput. Complex. 24, 179, 2017 | 10 | 2017 |
| Proof complexity of systems of (non-deterministic) decision trees and branching programs S Buss, A Das, A Knop arXiv preprint arXiv:1910.08503, 2019 | 6 | 2019 |
| Hard satisfiable formulas for splittings by linear combinations D Itsykson, A Knop International Conference on Theory and Applications of Satisfiability …, 2017 | 5 | 2017 |
| Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies K Khadiev, A Khadieva, A Knop Natural Computing, 1-14, 2022 | 4 | 2022 |
| 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 |
| Guest Column: Models of computation between decision trees and communication A Knop, S Lovett, S McGuire, W Yuan ACM SIGACT News 52 (2), 46-70, 2021 | 4 | 2021 |
| Statistical query complexity of manifold estimation E Aamari, A Knop Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 4 | 2021 |
| Circuit lower bounds for average-case MA A Knop International Computer Science Symposium in Russia, 283-295, 2015 | 3* | 2015 |
| Complexity of distributions and average-case hardness D Itsykson, A Knop, D Sokolov 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016 | 2 | 2016 |
| Heuristic time hierarchies via hierarchies for sampling distributions D Itsykson, A Knop, D Sokolov International Symposium on Algorithms and Computation, 201-211, 2015 | 2 | 2015 |
| Adversarial Manifold Estimation E Aamari, A Knop Foundations of Computational Mathematics, 1-97, 2022 | 1 | 2022 |
| Counting Distinct Elements Under Person-Level Differential Privacy A Knop, T Steinke arXiv preprint arXiv:2308.12947, 2023 | | 2023 |
| Differentially Private Linear Regression via Medians A Knop, T Steinke | | 2022 |
| Breaking Through the Reordering Obstacle in OBDD Proof Systems S Buss, D Itsykson, A Knop, D Sokolov | | 2018 |
| The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model. A Knop Electron. Colloquium Comput. Complex. 25, 177, 2018 | | 2018 |
Dmitry ItsyksonSteklov Institute of Mathematics at St. PetersburgVerified email at pdmi.ras.ru
