Robert Spalek

According to our database1, Robert Spalek authored at least 17 papers between 2003 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
Adversary Lower Bound for the Orthogonal Array Problem
CoRR, 2013

Adversary lower bound for the k-sum problem.
Proceedings of the Innovations in Theoretical Computer Science, 2013

2012
Span-Program-Based Quantum Algorithm for Evaluating Formulas.
Theory Comput., 2012

2011
Quantum Query Complexity of State Conversion.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Any AND-OR Formula of Size N Can Be Evaluated in Time N<sup>1/2+o(1)</sup> on a Quantum Computer.
SIAM J. Comput., 2010

2009
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs.
Algorithmica, 2009

2008
A Dual Polynomial for OR
CoRR, 2008

The Multiplicative Quantum Adversary.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

A Direct Product Theorem for Discrepancy.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, 2008

2007
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs.
SIAM J. Comput., 2007

Negative weights make adversaries stronger.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
All Quantum Adversary Methods are Equivalent.
Theory Comput., 2006

Quantum Algorithms for Matching and Network Flows.
Proceedings of the STACS 2006, 2006

Quantum verification of matrix products.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
Quantum Fan-out is Powerful.
Theory Comput., 2005

Lower Bounds on Quantum Query Complexity.
Bull. EATCS, 2005

2003
Quantum Circuits with Unbounded Fan-out.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003


  Loading...