Follow
Alexander Knop
Alexander Knop
Unknown affiliation
No verified email - Homepage
Title
Cited by
Cited by
Year
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
262020
Strategies for stable merge sorting
S Buss, A Knop
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
222019
Reordering rule makes OBDD proof systems stronger
S Buss, D Itsykson, A Knop, D Sokolov
33rd Computational Complexity Conference (CCC 2018), 2018
222018
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
192021
On the limits of gate elimination
A Golovnev, EA Hirsch, A Knop, AS Kulikov
Journal of Computer and System Sciences 96, 107-119, 2018
142018
IPS-like proof systems based on binary decision diagrams
A Knop
Typeset manuscript, June, 2017
122017
Statistical query complexity of manifold estimation
E Aamari, A Knop
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
92021
Hard satisfiable formulas for splittings by linear combinations
D Itsykson, A Knop
International Conference on Theory and Applications of Satisfiability …, 2017
72017
Proof complexity of systems of (non-deterministic) decision trees and branching programs
S Buss, A Das, A Knop
arXiv preprint arXiv:1910.08503, 2019
62019
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
52021
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
42023
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
42021
Circuit lower bounds for average-case MA
A Knop
International Computer Science Symposium in Russia, 283-295, 2015
3*2015
Adversarial manifold estimation
E Aamari, A Knop
Foundations of Computational Mathematics 24 (1), 1-97, 2024
22024
Complexity of distributions and average-case hardness
D Itsykson, A Knop, D Sokolov
27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
22016
Heuristic time hierarchies via hierarchies for sampling distributions
D Itsykson, A Knop, D Sokolov
International Symposium on Algorithms and Computation, 201-211, 2015
22015
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
12017
Counting Distinct Elements Under Person-Level Differential Privacy
T Steinke, A Knop
Advances in Neural Information Processing Systems 36, 2024
2024
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
The system can't perform the operation now. Try again later.
Articles 1–20