The SCEAS System
| |||||||

## Search the dblp DataBase
Robert Spalek:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hartmut Klauck, Robert Spalek, Ronald de Wolf
**Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:12-21 [Conf] - Robert Spalek, Mario Szegedy
**All Quantum Adversary Methods Are Equivalent.**[Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:1299-1311 [Conf] - Harry Buhrman, Robert Spalek
**Quantum verification of matrix products.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:880-889 [Conf] - Andris Ambainis, Robert Spalek
**Quantum Algorithms for Matching and Network Flows.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:172-183 [Conf] - Peter Høyer, Robert Spalek
**Quantum Circuits with Unbounded Fan-out.**[Citation Graph (0, 0)][DBLP] STACS, 2003, pp:234-246 [Conf] - Andris Ambainis, Robert Spalek, Ronald de Wolf
**A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:618-633 [Conf] - Peter Høyer, Robert Spalek
**Quantum Circuits with Unbounded Fan-out**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Hartmut Klauck, Robert Spalek, Ronald de Wolf
**Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Peter Høyer, Robert Spalek
**Lower Bounds on Quantum Query Complexity.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2005, v:87, n:, pp:78-103 [Journal] - Hartmut Klauck, Robert Spalek, Ronald de Wolf
**Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:045, pp:- [Journal] - Hartmut Klauck, Robert Spalek, Ronald de Wolf
**Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1472-1493 [Journal] - Peter Høyer, Troy Lee, Robert Spalek
**Negative weights make adversaries stronger.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:526-535 [Conf] **The Multiplicative Quantum Adversary.**[Citation Graph (, )][DBLP]**A Direct Product Theorem for Discrepancy.**[Citation Graph (, )][DBLP]**Any AND-OR Formula of Size N can be Evaluated in time N**[Citation Graph (, )][DBLP]^{1/2+o(1)}on a Quantum Computer.**Span-program-based quantum algorithm for evaluating formulas.**[Citation Graph (, )][DBLP]**A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs.**[Citation Graph (, )][DBLP]**A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs**[Citation Graph (, )][DBLP]**A Dual Polynomial for OR**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |