Robert Spalek
Robert Spalek
undisclosed
Verified email at ucw.cz - Homepage
Title
Cited by
Cited by
Year
Any AND-OR Formula of Size N Can Be Evaluated in Time on a Quantum Computer
A Ambainis, AM Childs, BW Reichardt, R Špalek, S Zhang
SIAM Journal on Computing 39 (6), 2513-2530, 2010
201*2010
Negative weights make adversaries stronger
P Hoyer, T Lee, R Spalek
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1722007
Quantum verification of matrix products
H Buhrman, R Spalek
arXiv preprint quant-ph/0409035, 2004
1442004
Quantum query complexity of state conversion
T Lee, R Mittal, BW Reichardt, R Špalek, M Szegedy
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 344-353, 2011
1202011
Span-program-based quantum algorithm for evaluating formulas
BW Reichardt, R Spalek
Proceedings of the fortieth annual ACM symposium on Theory of computing, 103-112, 2008
1192008
All quantum adversary methods are equivalent
R Špalek, M Szegedy
International Colloquium on Automata, Languages, and Programming, 1299-1311, 2005
1162005
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
H Klauck, R Špalek, R De Wolf
SIAM Journal on Computing 36 (5), 1472-1493, 2007
952007
A direct product theorem for discrepancy
T Lee, A Shraibman, R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008
792008
Quantum fan-out is powerful
P Høyer, R Špalek
Theory of computing 1 (1), 81-103, 2005
79*2005
Lower bounds on quantum query complexity. EATCS Bulletin, 87: 78–103, October 2005
P Høyer, R Špalek
arXiv preprint quant-ph/0509153, 0
62
Quantum algorithms for matching and network flows
A Ambainis, R Špalek
Annual Symposium on Theoretical Aspects of Computer Science, 172-183, 2006
482006
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
A Ambainis, R Špalek, R de Wolf
Algorithmica 55 (3), 422-461, 2009
332009
Adversary lower bound for the k-sum problem
A Belovs, R Spalek
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
322013
The multiplicative quantum adversary
R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 237-248, 2008
242008
A dual polynomial for OR
R Spalek
arXiv preprint arXiv:0803.4516, 2008
242008
Space complexity of quantum computation
R Špalek, R Špalek
quantum 35 (37), 53, 2001
72001
Quantum algorithms, lower bounds, and time-space tradeoffs
R Spalek
AmsterdamILLC, 2006
52006
Quantum circuits with unbounded fan-out
R Spalek
32002
Adversary lower bound for the orthogonal array problem
R Spalek
arXiv preprint arXiv:1304.0845, 2013
22013
Every NAND formula on N variables can be evaluated in time
AM Childs, BW Reichardt, R Špalek, S Zhang
arXiv preprint quant-ph/0703015, 0
1
The system can't perform the operation now. Try again later.
Articles 1–20