Alexander Knop

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 33

Top Topics

Query Complexity

Binary Decision Diagrams

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Eddie Aamari, Alexander Knop
Adversarial Manifold Estimation. Found. Comput. Math. 24 (1) (2024)
Alexander Knop, Thomas Steinke
Counting Distinct Elements Under Person-Level Differential Privacy. CoRR (2023)
Kamil Khadiev, Aliya Khadieva, Alexander Knop
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies. Nat. Comput. 22 (4) (2023)
Thomas Steinke, Alexander Knop
Counting Distinct Elements Under Person-Level Differential Privacy. NeurIPS (2023)
Kamil Khadiev, Aliya Khadieva, Alexander Knop
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies. CoRR (2022)
Eddie Aamari, Alexander Knop
Statistical query complexity of manifold estimation. STOC (2021)
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22 (4) (2021)
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
Guest Column: Models of computation between decision trees and communication. SIGACT News 52 (2) (2021)
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
Log-rank and lifting for AND-functions. STOC (2021)
Sam Buss, Anupam Das, Alexander Knop
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL (2020)
Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov
On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables. J. Symb. Log. 85 (2) (2020)
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
Log-rank and lifting for AND-functions. CoRR (2020)
Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. 27 (2020)
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
Log-rank and lifting for AND-functions. Electron. Colloquium Comput. Complex. 27 (2020)
Sam Buss, Alexander Knop
Strategies for Stable Merge Sorting. SODA (2019)
Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov
On OBDD-based algorithms and proof systems that dynamically change order of variables. Electron. Colloquium Comput. Complex. 26 (2019)
Sam Buss, Anupam Das, Alexander Knop
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR (2019)
Alexander Knop
The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model. Electron. Colloquium Comput. Complex. 25 (2018)
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov
On the limits of gate elimination. J. Comput. Syst. Sci. 96 (2018)
Sam Buss, Alexander Knop
Strategies for Stable Merge Sorting. CoRR (2018)
Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Reordering Rule Makes OBDD Proof Systems Stronger. Computational Complexity Conference (2018)
Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. 25 (2018)
Dmitry Itsykson, Alexander Knop
Hard satisfiable formulas for splittings by linear combinations. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS (2017)
Alexander Knop
IPS-like Proof Systems Based on Binary Decision Diagrams. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Itsykson, Alexander Knop
Hard Satisfiable Formulas for Splittings by Linear Combinations. SAT (2017)
Kamil Khadiev, Aliya Khadieva, Alexander Knop
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies. Electron. Colloquium Comput. Complex. 24 (2017)
Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Complexity of Distributions and Average-Case Hardness. ISAAC (2016)
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov
On the Limits of Gate Elimination. Electron. Colloquium Comput. Complex. 23 (2016)
Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov
On the Limits of Gate Elimination. MFCS (2016)
Alexander Knop
Circuit Lower Bounds for Average-Case MA. CSR (2015)
Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions. ISAAC (2015)
Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Complexity of distributions and average-case hardness. Electron. Colloquium Comput. Complex. 22 (2015)
Dmitry Itsykson, Alexander Knop, Dmitry Sokolov
Heuristic time hierarchies via hierarchies for sampling distributions. Electron. Colloquium Comput. Complex. 21 (2014)
Alexander Knop
Circuit Lower Bounds for Heuristic MA. Electron. Colloquium Comput. Complex. 20 (2013)