default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Alexander A. Sherstov
University of California, Los Angeles, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 108 matches
- 2024
- Alexander A. Sherstov, Andrey A. Storozhenko:
The Communication Complexity of Approximating Matrix Rank. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu:
An Optimal Separation of Randomized and Quantum Query Complexity. SIAM J. Comput. 52(2): 525-567 (2023) - 2022
- Ksenia Khabarova, Denis Kryuchkov, Alexander Borisenko, Ilia Zalivako, Ilya Semerikov, Mikhail Aksenov, Ivan Sherstov, Timur Abbasov, Anton Tausenev, Nikolay Kolachevsky:
Toward a New Generation of Compact Transportable Yb+ Optical Clocks. Symmetry 14(10): 2213 (2022) - Alexander A. Sherstov:
The approximate degree of DNF and CNF formulas. STOC 2022: 1194-1207 - Alexander A. Sherstov:
The Approximate Degree of DNF and CNF Formulas. CoRR abs/2209.01584 (2022) - Alexander A. Sherstov:
The Approximate Degree of DNF and CNF Formulas. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Alexander A. Sherstov:
The hardest halfspace. Comput. Complex. 30(2): 11 (2021) - Aleksandrs Belovs, Arturo Castellanos, Francois Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum communication complexity of distribution testing. Quantum Inf. Comput. 21(15&16): 1261-1273 (2021) - Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu:
An optimal separation of randomized and Quantum query complexity. STOC 2021: 1289-1302 - 2020
- Alexander A. Sherstov:
Algorithmic Polynomials. SIAM J. Comput. 49(6): 1173-1231 (2020) - Vladimir V. Podolskii, Alexander A. Sherstov:
Inner Product and Set Disjointness: Beyond Logarithmically Many Parties. ACM Trans. Comput. Theory 12(4): 26:1-26:28 (2020) - Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, Alexander A. Sherstov:
Quantum Communication Complexity of Distribution Testing. CoRR abs/2006.14870 (2020) - Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu:
An Optimal Separation of Randomized and Quantum Query Complexity. CoRR abs/2008.10223 (2020) - Alexander A. Sherstov, Andrey A. Storozhenko, Pei Wu:
An Optimal Separation of Randomized and Quantum Query Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - 2019
- Alexander A. Sherstov, Pei Wu:
Optimal Interactive Coding for Insertions, Deletions, and Substitutions. IEEE Trans. Inf. Theory 65(10): 5971-6000 (2019) - Alexander A. Sherstov, Pei Wu:
Near-optimal lower bounds on the threshold degree and sign-rank of AC0. STOC 2019: 401-412 - Alexander A. Sherstov, Pei Wu:
Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC0. CoRR abs/1901.00988 (2019) - Alexander A. Sherstov:
The Hardest Halfspace. CoRR abs/1902.01765 (2019) - Alexander A. Sherstov, Justin Thaler:
Vanishing-Error Approximate Degree and QMA Complexity. CoRR abs/1909.07498 (2019) - Alexander A. Sherstov:
The hardest halfspace. Electron. Colloquium Comput. Complex. TR19 (2019) - Alexander A. Sherstov, Justin Thaler:
Vanishing-Error Approximate Degree and QMA Complexity. Electron. Colloquium Comput. Complex. TR19 (2019) - Alexander A. Sherstov, Pei Wu:
Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC0. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- Alexander A. Sherstov:
Compressing Interactive Communication Under Product Distributions. SIAM J. Comput. 47(2): 367-419 (2018) - Alexander A. Sherstov:
Breaking the Minsky-Papert Barrier for Constant-Depth Circuits. SIAM J. Comput. 47(5): 1809-1857 (2018) - Alexander A. Sherstov:
The Power of Asymmetry in Constant-Depth Circuits. SIAM J. Comput. 47(6): 2362-2434 (2018) - Alexander A. Sherstov:
On Multiparty Communication with Large versus Unbounded Error. Theory Comput. 14(1): 1-17 (2018) - Alexander A. Sherstov:
Algorithmic polynomials. STOC 2018: 311-324 - Alexander A. Sherstov:
Algorithmic Polynomials. CoRR abs/1801.04607 (2018) - Alexander A. Sherstov:
Algorithmic polynomials. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- Alexander A. Sherstov, Pei Wu:
Optimal Interactive Coding for Insertions, Deletions, and Substitutions. FOCS 2017: 240-251
skipping 78 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-09 09:04 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint