Circuit Lower Bounds for Heuristic MA. - Alexander Knop (Electron. Colloquium Comput. Complex., 2013)

Heuristic time hierarchies via hierarchies for sampling distributions. - Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2014)

Circuit Lower Bounds for Average-Case MA. - Alexander Knop (CSR, 2015)

Complexity of distributions and average-case hardness. - Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2015)

Hard satisfiable formulas for splittings by linear combinations. - Dmitry Itsykson; 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)

IPS-like Proof Systems Based on Binary Decision Diagrams. - Alexander Knop (Electron. Colloquium Comput. Complex., 2017)

Reordering Rule Makes OBDD Proof Systems Stronger. - Sam Buss; Dmitry Itsykson; Alexander Knop; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2018)

The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model. - Alexander Knop (Electron. Colloquium Comput. Complex., 2018)

On the limits of gate elimination. - Alexander Golovnev; Edward A. Hirsch; Alexander Knop; Alexander S. Kulikov (J. Comput. Syst. Sci., 2018)

Strategies for Stable Merge Sorting. - Sam Buss; Alexander Knop (SODA, 2019)

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. - Sam Buss; Anupam Das 002; Alexander Knop (CSL, 2020)

Lower Bounds on OBDD Proofs with Several Orders. - Sam Buss; Dmitry Itsykson; Alexander Knop; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2020)

Log-rank and lifting for AND-functions. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (Electron. Colloquium Comput. Complex., 2020)

On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. - Dmitry Itsykson; Alexander Knop; Andrei E. Romashchenko; Dmitry Sokolov 001 (J. Symb. Log., 2020)

Statistical query complexity of manifold estimation. - Eddie Aamari; Alexander Knop (STOC, 2021)

Guest Column: Models of computation between decision trees and communication. - Alexander Knop; Shachar Lovett; Sam McGuire; Weiqiang Yuan 002 (SIGACT News, 2021)

Counting Distinct Elements Under Person-Level Differential Privacy. - Thomas Steinke 002; Alexander Knop (NeurIPS, 2023)

On the Differential Privacy and Interactivity of Privacy Sandbox Reports. - Badih Ghazi; Charlie Harrison; Arpana Hosabettu; Pritish Kamath; Alexander Knop; S. Ravi Kumar 001; Ethan Leeman; Pasin Manurangsi; Vikas Sahu (CoRR, 2024)

Adversarial Manifold Estimation. - Eddie Aamari; Alexander Knop (Found. Comput. Math., 2024)

PREM: Privately Answering Statistical Queries with Relative Error. - Badih Ghazi; Cristóbal Guzmán; Pritish Kamath; Alexander Knop; Ravi Kumar 001; Pasin Manurangsi; Sushant Sachdeva (COLT, 2025)

Supercritical Tradeoff Between Size and Depth for Resolution over Parities. - Dmitry Itsykson; Alexander Knop (Electron. Colloquium Comput. Complex., 2025)

On the Differential Privacy and Interactivity of Privacy Sandbox Reports. - Badih Ghazi; Charlie Harrison; Arpana Hosabettu; Pritish Kamath; Alexander Knop; Ravi Kumar 001; Ethan Leeman; Pasin Manurangsi; Mariana Raykova 001; Vikas Sahu; Phillipp Schoppmann (Proc. Priv. Enhancing Technol., 2025)

Urania: Differentially Private Insights into AI Use. - Daogao Liu; Edith Cohen; Badih Ghazi; Peter Kairouz; Pritish Kamath; Alexander Knop; Ravi Kumar 001; Pasin Manurangsi; Adam Sealfon; Da Yu; Chiyuan Zhang (CoRR, 2025)