We stand with Ukraine  

Alexander Knop

Orcid: 0000-0003-4311-9071

Affiliations:
  • University of California, San Diego, Department of Mathematics, CA, USA
  • Steklov Institute of Mathematics, Saint Petersburg, Russia


According to our database1, Alexander Knop authored at least 19 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Adversarial Manifold Estimation.
[BibTeX]
[DOI]
Eddie Aamari
,
Alexander Knop
Found. Comput. Math., February, 2024

2023
Counting Distinct Elements Under Person-Level Differential Privacy.
[BibTeX]
[DOI]
Thomas Steinke
,
Alexander Knop
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2021
Lower Bounds on OBDD Proofs with Several Orders.
[BibTeX]
[DOI]
Sam Buss
,
Dmitry Itsykson
,
Alexander Knop
,
Artur Riazanov
,
Dmitry Sokolov
ACM Trans. Comput. Log., 2021

Guest Column: Models of computation between decision trees and communication.
[BibTeX]
[DOI]
Alexander Knop
,
Shachar Lovett
,
Sam McGuire
,
Weiqiang Yuan
SIGACT News, 2021

Statistical query complexity of manifold estimation.
[BibTeX]
[DOI]
Eddie Aamari
,
Alexander Knop
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020
On OBDD-based Algorithms and Proof Systems that Dynamically Change the order of Variables.
[BibTeX]
[DOI]
Dmitry Itsykson
,
Alexander Knop
,
Andrei E. Romashchenko
,
Dmitry Sokolov
J. Symb. Log., 2020

Log-rank and lifting for AND-functions.
[BibTeX]
[DOI]
Alexander Knop
,
Shachar Lovett
,
Sam McGuire
,
Weiqiang Yuan
Electron. Colloquium Comput. Complex., 2020

Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs.
[BibTeX]
[DOI]
Sam Buss
,
Anupam Das
,
Alexander Knop
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Strategies for Stable Merge Sorting.
[BibTeX]
[DOI]
Sam Buss
,
Alexander Knop
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
On the limits of gate elimination.
[BibTeX]
[DOI]
Alexander Golovnev
,
Edward A. Hirsch
,
Alexander Knop
,
Alexander S. Kulikov
J. Comput. Syst. Sci., 2018

The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model.
[BibTeX]
[DOI]
Alexander Knop
Electron. Colloquium Comput. Complex., 2018

Reordering Rule Makes OBDD Proof Systems Stronger.
[BibTeX]
[DOI]
Sam Buss
,
Dmitry Itsykson
,
Alexander Knop
,
Dmitry Sokolov
Electron. Colloquium Comput. Complex., 2018

2017
IPS-like Proof Systems Based on Binary Decision Diagrams.
[BibTeX]
[DOI]
Alexander Knop
Electron. Colloquium Comput. Complex., 2017

Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies.
[BibTeX]
[DOI]
Kamil Khadiev
,
Aliya Khadieva
,
Alexander Knop
Electron. Colloquium Comput. Complex., 2017

Hard satisfiable formulas for splittings by linear combinations.
[BibTeX]
[DOI]
Dmitry Itsykson
,
Alexander Knop
Electron. Colloquium Comput. Complex., 2017

2015
Complexity of distributions and average-case hardness.
[BibTeX]
[DOI]
Dmitry Itsykson
,
Alexander Knop
,
Dmitry Sokolov
Electron. Colloquium Comput. Complex., 2015

Circuit Lower Bounds for Average-Case MA.
[BibTeX]
[DOI]
Alexander Knop
Proceedings of the Computer Science - Theory and Applications, 2015

2014
Heuristic time hierarchies via hierarchies for sampling distributions.
[BibTeX]
[DOI]
Dmitry Itsykson
,
Alexander Knop
,
Dmitry Sokolov
Electron. Colloquium Comput. Complex., 2014

2013
Circuit Lower Bounds for Heuristic MA.
[BibTeX]
[DOI]
Alexander Knop
Electron. Colloquium Comput. Complex., 2013


  Loading...