Quantum Circuits with Unbounded Fan-out. - Peter Høyer; Robert Spalek (STACS, 2003)

Lower Bounds on Quantum Query Complexity. - Peter Høyer; Robert Spalek (Bull. EATCS, 2005)

Quantum Fan-out is Powerful. - Peter Høyer; Robert Spalek (Theory Comput., 2005)

Quantum verification of matrix products. - Harry Buhrman; Robert Spalek (SODA, 2006)

Quantum Algorithms for Matching and Network Flows. - Andris Ambainis; Robert Spalek (STACS, 2006)

All Quantum Adversary Methods are Equivalent. - Robert Spalek; Mario Szegedy (Theory Comput., 2006)

Negative weights make adversaries stronger. - Peter Høyer; Troy Lee; Robert Spalek (STOC, 2007)

Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs. - Hartmut Klauck; Robert Spalek; Ronald de Wolf (SIAM J. Comput., 2007)

A Direct Product Theorem for Discrepancy. - Troy Lee; Adi Shraibman; Robert Spalek (CCC, 2008)

The Multiplicative Quantum Adversary. - Robert Spalek (CCC, 2008)

A Dual Polynomial for OR - Robert Spalek (CoRR, 2008)

A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. - Andris Ambainis; Robert Spalek; Ronald de Wolf (Algorithmica, 2009)

Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer. - Andris Ambainis; Andrew M. Childs; Ben Reichardt; Robert Spalek; Shengyu Zhang (SIAM J. Comput., 2010)

Quantum Query Complexity of State Conversion. - Troy Lee; Rajat Mittal 001; Ben W. Reichardt; Robert Spalek; Mario Szegedy (FOCS, 2011)

Span-Program-Based Quantum Algorithm for Evaluating Formulas. - Ben Reichardt; Robert Spalek (Theory Comput., 2012)

Adversary lower bound for the k-sum problem. - Aleksandrs Belovs; Robert Spalek (ITCS, 2013)

Adversary Lower Bound for the Orthogonal Array Problem - Robert Spalek (CoRR, 2013)