BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
6 × USA
Collaborated with:

Talks about:
communic (4) bound (3) polynomi (2) quantum (2) complex (2) circuit (2) direct (2) lower (2) depth (2) multiparti (1)

Person: Alexander A. Sherstov

DBLP DBLP: Sherstov:Alexander_A=

Contributed to:

STOC 20142014
STOC 20132013
STOC 20122012
STOC 20112011
STOC 20102010
STOC 20082008
STOC 20072007

Wrote 8 papers:

Breaking the minsky-papert barrier for constant-depth circuits (AAS), pp. 223–232.
STOC-2013-Sherstov #bound #communication #using
Communication lower bounds using directional derivatives (AAS), pp. 921–930.
STOC-2012-Sherstov #communication #complexity #multi #set
The multiparty communication complexity of set disjointness (AAS), pp. 525–548.
STOC-2012-Sherstov12a #robust
Making polynomials robust to noise (AAS), pp. 747–758.
STOC-2011-Sherstov #communication #complexity #quantum #query #theorem
Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.
STOC-2010-Sherstov #bound
Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (AAS), pp. 523–532.
STOC-2008-Sherstov #bound #communication #matrix #quantum
The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.
Separating AC0 from depth-2 majority circuits (AAS), pp. 294–301.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.