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 × Czech Republic
1 × Denmark
1 × Greece
1 × Italy
1 × United Kingdom
7 × USA
Collaborated with:
U.V.Vazirani S.Aaronson J.Kempe A.Nayak M.Bavarian K.Balodis Y.Filmus F.L.Gall O.Sattath R.Spalek R.d.Wolf L.J.Schulman D.Aharonov A.Ta-Shma E.Bach A.Vishwanath J.Watrous E.Allender D.A.M.Barrington S.Datta H.LeThanh Y.Gao J.Mao X.Sun S.Zuo A.Backurs D.Kravcenko R.Ozols J.Smotrovs M.Virza
Talks about:
quantum (13) bound (6) lower (4) algorithm (2) complex (2) classic (2) method (2) comput (2) walk (2) new (2)

Person: Andris Ambainis

DBLP DBLP: Ambainis:Andris

Contributed to:

STOC 20152015
ICALP (1) 20142014
STOC 20132013
ICALP (1) 20122012
STOC 20102010
STOC 20062006
STOC 20042004
STOC 20012001
STOC 20002000
ICALP 19991999
STOC 19991999
ICALP 19971997

Wrote 17 papers:

STOC-2015-AaronsonA #named #problem #quantum
Forrelation: A Problem that Optimally Separates Quantum from Classical Computing (SA, AA), pp. 307–316.
STOC-2015-AmbainisFG #matrix #multi #performance
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (AA, YF, FLG), pp. 585–593.
Weak Parity (SA, AA, KB, MB), pp. 26–38.
ICALP-v1-2014-AmbainisBGMSZ #complexity #metric
Tighter Relations between Sensitivity and Other Complexity Measures (AA, MB, YG, JM, XS, SZ), pp. 101–113.
STOC-2013-Ambainis #algorithm #quantum
Superlinear advantage for exact quantum algorithms (AA), pp. 891–900.
ICALP-v1-2012-AmbainisBBKOSV #game studies #quantum
Quantum Strategies Are Better Than Classical in Almost Any XOR Game (AA, AB, KB, DK, RO, JS, MV), pp. 25–37.
STOC-2010-AmbainisKS #quantum
A quantum lovász local lemma (AA, JK, OS), pp. 151–160.
STOC-2006-AmbainisSW #bound #quantum #theorem #trade-off
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs (AA, RS, RdW), pp. 618–633.
STOC-2004-Ambainis #algorithm #quantum
Quantum algorithms a decade after shor (AA), p. 111.
STOC-2001-Ambainis #bound #protocol #quantum
A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.
STOC-2001-AmbainisBNVW #quantum
One-dimensional quantum walks (AA, EB, AN, AV, JW), pp. 37–49.
STOC-2001-AmbainisKV #graph #quantum
Quantum walks on graphs (DA, AA, JK, UVV), pp. 50–59.
STOC-2000-Ambainis #bound #quantum
Quantum lower bounds by quantum arguments (AA), pp. 636–643.
Computing with highly mixed states (AA, LJS, UVV), pp. 697–704.
ICALP-1999-AllenderABDL #bound
Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.
STOC-1999-AmbainisNTV #automaton #bound #quantum
Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
ICALP-1997-Ambainis #bound #communication #complexity #information retrieval
Upper Bound on Communication Complexity of Private Information Retrieval (AA), pp. 401–407.

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.