| 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 | 28 | 2020 |
| 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 | 23 | 2021 |
| Reordering rule makes OBDD proof systems stronger S Buss, D Itsykson, A Knop, D Sokolov 33rd Computational Complexity Conference (CCC 2018), 2018 | 23 | 2018 |
| Strategies for stable merge sorting S Buss, A Knop Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 22 | 2019 |
| On the limits of gate elimination A Golovnev, EA Hirsch, A Knop, AS Kulikov Journal of Computer and System Sciences 96, 107-119, 2018 | 14 | 2018 |
| Statistical query complexity of manifold estimation E Aamari, A Knop Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 12 | 2021 |
| IPS-like proof systems based on binary decision diagrams A Knop Typeset manuscript, June, 2017 | 12 | 2017 |
| 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 | 7 | 2021 |
| Hard satisfiable formulas for splittings by linear combinations D Itsykson, A Knop International Conference on Theory and Applications of Satisfiability …, 2017 | 7 | 2017 |
| Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies K Khadiev, A Khadieva, A Knop Natural Computing 22 (4), 723-736, 2023 | 6 | 2023 |
| 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 |
| 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 | 5 | 2021 |
| Adversarial manifold estimation E Aamari, A Knop Foundations of Computational Mathematics 24 (1), 1-97, 2024 | 3 | 2024 |
| 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 |
| Counting distinct elements under person-level differential privacy A Knop, T Steinke arXiv preprint arXiv:2308.12947, 2023 | 1 | 2023 |
| Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies K Khadiev, A Khadieva, A Knop Electronic Colloquium on Computational Complexity (ECCC) 24, 176, 2017 | 1 | 2017 |
| On the Differential Privacy and Interactivity of Privacy Sandbox Reports B Ghazi, C Harrison, A Hosabettu, P Kamath, A Knop, R Kumar, ... arXiv preprint arXiv:2412.16916, 2024 | | 2024 |
| Counting Distinct Elements Under Person-Level Differential Privacy T Steinke, A Knop Advances in Neural Information Processing Systems 36, 2024 | | 2024 |
Dmitry ItsyksonSteklov Institute of Mathematics at St. PetersburgVerified email at pdmi.ras.ru
