| 2026 | COLT | Fixed-Parameter Tractability of Private Synthetic Data Generation. | Badih Ghazi, Cristbal Guzmn, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi |
| 2025 | COLT | PREM: Privately Answering Statistical Queries with Relative Error. | Badih Ghazi, Cristbal Guzmn, Pritish Kamath, Alexander Knop, Ravi Kumar, Pasin Manurangsi, Sushant Sachdeva |
| 2021 | STOC | Statistical query complexity of manifold estimation. | Eddie Aamari, Alexander Knop |
| 2021 | STOC | Log-rank and lifting for AND-functions. | Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan |
| 2020 | CSL | Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. | Sam Buss, Anupam Das, Alexander Knop |
| 2019 | SODA | Strategies for Stable Merge Sorting. | Sam Buss, Alexander Knop |
| 2017 | STACS | On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. | Dmitry Itsykson, Alexander Knop, Andrei Romashchenko, Dmitry Sokolov |
| 2017 | SAT | Hard Satisfiable Formulas for Splittings by Linear Combinations. | Dmitry Itsykson, Alexander Knop |
| 2016 | ISAAC | Complexity of Distributions and Average-Case Hardness. | Dmitry Itsykson, Alexander Knop, Dmitry Sokolov |
| 2016 | MFCS | On the Limits of Gate Elimination. | Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov |
| 2015 | CSR | Circuit Lower Bounds for Average-Case MA. | Alexander Knop |
| 2015 | ISAAC | Heuristic Time Hierarchies via Hierarchies for Sampling Distributions. | Dmitry Itsykson, Alexander Knop, Dmitry Sokolov |