default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Knop
Person information
- affiliation: University of California, San Diego, Department of Mathematics, CA, USA
- affiliation: Steklov Institute of Mathematics, Saint Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Eddie Aamari, Alexander Knop:
Adversarial Manifold Estimation. Found. Comput. Math. 24(1): 1-97 (2024)- 2023
- [j5]Kamil Khadiev
, Aliya Khadieva, Alexander Knop:
Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies. Nat. Comput. 22(4): 723-736 (2023) - [c12]Thomas Steinke, Alexander Knop:
Counting Distinct Elements Under Person-Level Differential Privacy. NeurIPS 2023 - [i17]Alexander Knop, Thomas Steinke:
Counting Distinct Elements Under Person-Level Differential Privacy. CoRR abs/2308.12947 (2023) - 2022
- [i16]Kamil Khadiev, Aliya Khadieva, Alexander Knop:
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies. CoRR abs/2204.10671 (2022) - 2021
- [j4]Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan:
Guest Column: Models of computation between decision trees and communication. SIGACT News 52(2): 46-70 (2021) - [j3]Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. ACM Trans. Comput. Log. 22(4): 26:1-26:30 (2021) - [c11]Eddie Aamari, Alexander Knop:
Statistical query complexity of manifold estimation. STOC 2021: 116-122 - [c10]Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan:
Log-rank and lifting for AND-functions. STOC 2021: 197-208 - 2020
- [j2]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): 632-670 (2020) - [c9]Sam Buss, Anupam Das, Alexander Knop:
Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs. CSL 2020: 12:1-12:17 - [i15]Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan:
Log-rank and lifting for AND-functions. CoRR abs/2010.08994 (2020) - [i14]Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. Electron. Colloquium Comput. Complex. TR20 (2020) - [i13]Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan:
Log-rank and lifting for AND-functions. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c8]Sam Buss, Alexander Knop:
Strategies for Stable Merge Sorting. SODA 2019: 1272-1290 - [i12]Sam Buss, Anupam Das, Alexander Knop:
Proof complexity of systems of (non-deterministic) decision trees and branching programs. CoRR abs/1910.08503 (2019) - [i11]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. TR19 (2019) - 2018
- [j1]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the limits of gate elimination. J. Comput. Syst. Sci. 96: 107-119 (2018) - [c7]Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. CCC 2018: 16:1-16:24 - [i10]Sam Buss, Alexander Knop:
Strategies for Stable Merge Sorting. CoRR abs/1801.04641 (2018) - [i9]Sam Buss, Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Reordering Rule Makes OBDD Proof Systems Stronger. Electron. Colloquium Comput. Complex. TR18 (2018) - [i8]Alexander Knop:
The Diptych of Communication Complexity Classes in the Best-partition Model and the Fixed-partition Model. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c6]Dmitry Itsykson, Alexander Knop:
Hard Satisfiable Formulas for Splittings by Linear Combinations. SAT 2017: 53-61 - [c5]Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. STACS 2017: 43:1-43:14 - [i7]Dmitry Itsykson, Alexander Knop:
Hard satisfiable formulas for splittings by linear combinations. Electron. Colloquium Comput. Complex. TR17 (2017) - [i6]Kamil Khadiev, Aliya Khadieva, Alexander Knop:
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies. Electron. Colloquium Comput. Complex. TR17 (2017) - [i5]Alexander Knop:
IPS-like Proof Systems Based on Binary Decision Diagrams. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of Distributions and Average-Case Hardness. ISAAC 2016: 38:1-38:12 - [c3]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. MFCS 2016: 46:1-46:13 - [i4]Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov:
On the Limits of Gate Elimination. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c2]Alexander Knop:
Circuit Lower Bounds for Average-Case MA. CSR 2015: 283-295 - [c1]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Heuristic Time Hierarchies via Hierarchies for Sampling Distributions. ISAAC 2015: 201-211 - [i3]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Complexity of distributions and average-case hardness. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i2]Dmitry Itsykson, Alexander Knop, Dmitry Sokolov:
Heuristic time hierarchies via hierarchies for sampling distributions. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i1]Alexander Knop:
Circuit Lower Bounds for Heuristic MA. Electron. Colloquium Comput. Complex. TR13 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
