Alexander Knop

According to our database, Alexander Knop authored at least 25 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Private Hyperparameter Tuning with Ex-Post Guarantee.

Badih Ghazi, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Chiyuan Zhang

CoRR, August, 2025

Urania: Differentially Private Insights into AI Use.

Daogao Liu, Edith Cohen, Badih Ghazi, Peter Kairouz, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Adam Sealfon, Da Yu, Chiyuan Zhang

CoRR, June, 2025

On the Differential Privacy and Interactivity of Privacy Sandbox Reports.

Badih Ghazi, Charlie Harrison, Arpana Hosabettu, Pritish Kamath, Alexander Knop, Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Mariana Raykova, Vikas Sahu, Phillipp Schoppmann

Proc. Priv. Enhancing Technol., 2025

Supercritical Tradeoff Between Size and Depth for Resolution over Parities.

Dmitry Itsykson, Alexander Knop

Electron. Colloquium Comput. Complex., 2025

PREM: Privately Answering Statistical Queries with Relative Error.

Badih Ghazi, Cristóbal Guzmán, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Sushant Sachdeva

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Adversarial Manifold Estimation.

Eddie Aamari, Alexander Knop

Found. Comput. Math., February, 2024

On the Differential Privacy and Interactivity of Privacy Sandbox Reports.

Badih Ghazi, Charlie Harrison, Arpana Hosabettu, Pritish Kamath, Alexander Knop, S. Ravi Kumar, Ethan Leeman, Pasin Manurangsi, Vikas Sahu

CoRR, 2024

2023

Counting Distinct Elements Under Person-Level Differential Privacy.

Thomas Steinke, Alexander Knop

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021

Guest Column: Models of computation between decision trees and communication.

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

SIGACT News, 2021

Log-rank and lifting for AND-functions.

Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Statistical query complexity of manifold estimation.

Eddie Aamari, Alexander Knop

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Lower Bounds on OBDD Proofs with Several Orders.

Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov

Electron. Colloquium Comput. Complex., 2020

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs.

Sam Buss, Anupam Das, Alexander Knop

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Strategies for Stable Merge Sorting.

Sam Buss, Alexander Knop

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model.

Alexander Knop

Electron. Colloquium Comput. Complex., 2018

Reordering Rule Makes OBDD Proof Systems Stronger.

Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

IPS-like Proof Systems Based on Binary Decision Diagrams.

Alexander Knop

Electron. Colloquium Comput. Complex., 2017

Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies.

Kamil Khadiev, Aliya Khadieva, Alexander Knop

Electron. Colloquium Comput. Complex., 2017

On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables.

Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Hard Satisfiable Formulas for Splittings by Linear Combinations.

Dmitry Itsykson, Alexander Knop

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016

On the Limits of Gate Elimination.

Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Complexity of Distributions and Average-Case Hardness.

Dmitry Itsykson, Alexander Knop, Dmitry Sokolov

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

Heuristic Time Hierarchies via Hierarchies for Sampling Distributions.

Dmitry Itsykson, Alexander Knop, Dmitry Sokolov

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Circuit Lower Bounds for Average-Case MA.

Alexander Knop

Proceedings of the Computer Science - Theory and Applications, 2015

2013

Circuit Lower Bounds for Heuristic MA.

Alexander Knop

Electron. Colloquium Comput. Complex., 2013