Seguir
Robert Spalek
Robert Spalek
undisclosed
Dirección de correo verificada de ucw.cz - Página principal
Título
Citado por
Citado por
Año
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
251*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
2272007
Quantum verification of matrix products
H Buhrman, R Spalek
arXiv preprint quant-ph/0409035, 2004
1812004
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
1722011
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
1452008
All quantum adversary methods are equivalent
R Špalek, M Szegedy
International Colloquium on Automata, Languages, and Programming, 1299-1311, 2005
1402005
Quantum fan-out is powerful
P Høyer, R Špalek
Theory of computing 1 (1), 81-103, 2005
138*2005
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
1292007
A direct product theorem for discrepancy
T Lee, A Shraibman, R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 71-80, 2008
1062008
Lower bounds on quantum query complexity. EATCS Bulletin, 87: 78–103, October 2005
P Høyer, R Špalek
arXiv preprint quant-ph/0509153, 0
78
Quantum algorithms for matching and network flows
A Ambainis, R Špalek
Annual Symposium on Theoretical Aspects of Computer Science, 172-183, 2006
682006
Adversary lower bound for the k-sum problem
A Belovs, R Spalek
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
512013
A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
A Ambainis, R Špalek, R de Wolf
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006
462006
The multiplicative quantum adversary
R Špalek
2008 23rd Annual IEEE Conference on Computational Complexity, 237-248, 2008
362008
A dual polynomial for OR
R Spalek
arXiv preprint arXiv:0803.4516, 2008
332008
Space complexity of quantum computation
R Špalek, R Špalek
quantum 35 (37), 53, 2001
72001
Quantum algorithms, lower bounds, and time-space tradeoffs
R Špalek
University of Amsterdam, 2006
52006
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
T Lee, R Mittal, B Reichardt, R Spalek, M Szegedy
IEEE, 2011
42011
Adversary lower bound for the orthogonal array problem
R Spalek
arXiv preprint arXiv:1304.0845, 2013
32013
Quantum circuits with unbounded fan-out
R Spalek
Proceedings of the 20th International Symposium on Theoretical Aspects of …, 2003
32003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20