Robert Spalek

Publication Activity (10 Years)

Years Active: 2002-2013
Publications (10 Years): 0

Top Topics

Linear Programming Relaxation

Top Venues

Publications

Robert Spalek
Adversary Lower Bound for the Orthogonal Array Problem CoRR (2013)
Aleksandrs Belovs, Robert Spalek
Adversary lower bound for the k-sum problem. ITCS (2013)
Aleksandrs Belovs, Robert Spalek
Adversary Lower Bound for the k-sum Problem CoRR (2012)
Ben Reichardt, Robert Spalek
Span-Program-Based Quantum Algorithm for Evaluating Formulas. Theory Comput. 8 (1) (2012)
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Spalek, Mario Szegedy
Quantum Query Complexity of State Conversion. FOCS (2011)
Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang
on a Quantum Computer. SIAM J. Comput. 39 (6) (2010)
Andris Ambainis, Robert Spalek, Ronald de Wolf
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. Algorithmica 55 (3) (2009)
Robert Spalek
The Multiplicative Quantum Adversary. Computational Complexity Conference (2008)
Ben Reichardt, Robert Spalek
Span-program-based quantum algorithm for evaluating formulas. STOC (2008)
Robert Spalek
A Dual Polynomial for OR CoRR (2008)
Troy Lee, Adi Shraibman, Robert Spalek
A Direct Product Theorem for Discrepancy. Computational Complexity Conference (2008)
Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang
on a Quantum Computer. FOCS (2007)
Peter Høyer, Troy Lee, Robert Spalek
Negative weights make adversaries stronger. STOC (2007)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. SIAM J. Comput. 36 (5) (2007)
Harry Buhrman, Robert Spalek
Quantum verification of matrix products. SODA (2006)
Andris Ambainis, Robert Spalek
Quantum Algorithms for Matching and Network Flows. STACS (2006)
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)
Robert Spalek, Mario Szegedy
All Quantum Adversary Methods are Equivalent. Theory Comput. 2 (1) (2006)
Robert Spalek, Mario Szegedy
All Quantum Adversary Methods Are Equivalent. ICALP (2005)
Peter Høyer, Robert Spalek
Lower Bounds on Quantum Query Complexity. Bull. EATCS 87 (2005)
Peter Høyer, Robert Spalek
Quantum Fan-out is Powerful. Theory Comput. 1 (1) (2005)
Andris Ambainis, Robert Spalek, Ronald de Wolf
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs CoRR (2005)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs Electron. Colloquium Comput. Complex. (045) (2004)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs CoRR (2004)
Hartmut Klauck, Robert Spalek, Ronald de Wolf
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. FOCS (2004)
Peter Høyer, Robert Spalek
Quantum Circuits with Unbounded Fan-out. STACS (2003)
Peter Høyer, Robert Spalek
Quantum Circuits with Unbounded Fan-out CoRR (2002)