| 2008 |
|---|
| 20 | EE | Robert Spalek:
The Multiplicative Quantum Adversary.
IEEE Conference on Computational Complexity 2008: 237-248 |
| 19 | EE | Troy Lee,
Adi Shraibman,
Robert Spalek:
A Direct Product Theorem for Discrepancy.
IEEE Conference on Computational Complexity 2008: 71-80 |
| 18 | EE | Ben Reichardt,
Robert Spalek:
Span-program-based quantum algorithm for evaluating formulas.
STOC 2008: 103-112 |
| 17 | EE | Robert Spalek:
A Dual Polynomial for OR
CoRR abs/0803.4516: (2008) |
| 2007 |
|---|
| 16 | EE | Andris Ambainis,
Andrew M. Childs,
Ben Reichardt,
Robert Spalek,
Shengyu Zhang:
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer.
FOCS 2007: 363-372 |
| 15 | EE | Peter Høyer,
Troy Lee,
Robert Spalek:
Negative weights make adversaries stronger.
STOC 2007: 526-535 |
| 14 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.
SIAM J. Comput. 36(5): 1472-1493 (2007) |
| 2006 |
|---|
| 13 | EE | Harry Buhrman,
Robert Spalek:
Quantum verification of matrix products.
SODA 2006: 880-889 |
| 12 | EE | Andris Ambainis,
Robert Spalek:
Quantum Algorithms for Matching and Network Flows.
STACS 2006: 172-183 |
| 11 | EE | Andris Ambainis,
Robert Spalek,
Ronald de Wolf:
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs.
STOC 2006: 618-633 |
| 10 | EE | Robert Spalek,
Mario Szegedy:
All Quantum Adversary Methods are Equivalent.
Theory of Computing 2(1): 1-18 (2006) |
| 2005 |
|---|
| 9 | EE | Robert Spalek,
Mario Szegedy:
All Quantum Adversary Methods Are Equivalent.
ICALP 2005: 1299-1311 |
| 8 | | Peter Høyer,
Robert Spalek:
Lower Bounds on Quantum Query Complexity.
Bulletin of the EATCS 87: 78-103 (2005) |
| 7 | EE | Andris Ambainis,
Robert Spalek,
Ronald de Wolf:
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
CoRR abs/quant-ph/0511200: (2005) |
| 6 | EE | Peter Høyer,
Robert Spalek:
Quantum Fan-out is Powerful.
Theory of Computing 1(1): 81-103 (2005) |
| 2004 |
|---|
| 5 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.
FOCS 2004: 12-21 |
| 4 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
CoRR quant-ph/0402123: (2004) |
| 3 | EE | Hartmut Klauck,
Robert Spalek,
Ronald de Wolf:
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Electronic Colloquium on Computational Complexity (ECCC)(045): (2004) |
| 2003 |
|---|
| 2 | EE | Peter Høyer,
Robert Spalek:
Quantum Circuits with Unbounded Fan-out.
STACS 2003: 234-246 |
| 2002 |
|---|
| 1 | EE | Peter Høyer,
Robert Spalek:
Quantum Circuits with Unbounded Fan-out
CoRR quant-ph/0208043: (2002) |
