Technical reports:  
Adversary Lower Bound for the Orthogonal Array Problem.
Robert Špalek.

arXiv:1304.0845 [quantph] 
A dual polynomial for OR.
Robert Špalek.

arXiv:0803.4516 [cs.CC] 
Conference papers:  
Adversary Lower Bound for the ksum Problem.
Aleksandrs Belovs and Robert Špalek.
In Proceeding of 4th Annual ACM Conference on Innovations in
Theoretical Computer Science (ITCS'13), pages 323328,
Berkeley, California, 2013.

arXiv:1206.6528 [quantph] 
Quantum query complexity of state conversion.
Troy Lee, Rajat Mittal, Ben W. Reichardt, Robert Špalek, and Mario
Szegedy.
In Proceeding of 52nd Annual IEEE Symposium on
Foundations of Computer Science (FOCS'11), pages 344353,
Palm Springs, California, 2011.

arXiv:1011.3020 [quantph] 
The Multiplicative Quantum Adversary.
Robert Špalek.
In Proceedings of 23rd Annual IEEE Conference on Computational
Complexity (CCC'08),
pages 237248, College Park, Maryland, 2008.

quantph/0703237 
A direct product theorem for discrepancy.
Troy Lee, Adi Shraibman, and Robert Špalek.
In Proceedings of 23rd Annual IEEE Conference on Computational
Complexity (CCC'08),
pages 7180, College Park, Maryland, 2008.


Negative weights make adversaries stronger.
Peter Høyer, Troy Lee, and Robert Špalek.
In Proceedings of 39th Annual ACM Symposium on Theory of Computing
(STOC'07),
pages 526535, San Diego, California, 2007.

quantph/0611054 computing Adv 
Quantum Algorithms for Matching and Network Flows.

quantph/0508205 
Quantum Verification of Matrix Products.
Harry Buhrman and Robert Špalek.
In Proceedings of 17th Annual ACMSIAM Symposium on Discrete
Algorithms (SODA'06),
pages 880889, Miami, Florida, 2006.

quantph/0409035 
Journal papers:  
Spanprogrambased quantum algorithm for evaluating formulas.
Ben Reichardt and Robert Špalek.
Theory of Computing,
8(13):291319, 2012.
Conference version in Proceedings of 40th Annual ACM Symposium on
Theory of Computing (STOC'08), pages
103112, Victoria, British Columbia, 2008.

arXiv:0710.2630 [quantph] computing wsize 
Any ANDOR formula of size N can be evaluated in
time N^{½+o(1)} on a quantum computer.
Andris Ambainis, Andrew Childs, Ben Reichardt, Robert Špalek, and Shengyu Zhang.
SIAM Journal on Computing,
39(6):25132530, 2010.
Special issue of FOCS'07.
Conference version in Proceeding of 48th Annual IEEE Symposium on
Foundations of Computer Science (FOCS'07), pages 363372, Providence,
Rhode Island, 2007.

quantph/0703015 
A New Quantum Lower Bound Method, with Applications to
Direct Product Theorems and TimeSpace Tradeoffs.
Andris Ambainis, Robert Špalek, and Ronald de Wolf.
Algorithmica,
55(3):422–461, 2009.
Conference version in Proceedings of 38th Annual ACM Symposium on Theory of Computing
(STOC'06),
pages 618633, Seattle, Washington, 2006.

quantph/0511200 
Quantum and Classical Strong Direct Product Theorems and Optimal TimeSpace Tradeoffs.
Hartmut Klauck, Robert Špalek, and Ronald de Wolf.
SIAM Journal on Computing,
36(5):14721493, 2007.
Conference version in Proceeding of 45th Annual IEEE Symposium on
Foundations of Computer Science
(FOCS'04), pages
1221, Rome, Italy, 2004.

quantph/0402123 ECCC TR04045 
All Quantum Adversary Methods are Equivalent.
Robert Špalek and Mario Szegedy.
Theory of Computing,
2(1):118, 2006.

quantph/0409116 
Lower Bounds on Quantum Query Complexity.
Peter Høyer and Robert Špalek.
Survey. Bulletin
of the European Association for Theoretical Computer
Science, 87:78103, October 2005.

quantph/0509153 
Quantum Fanout is Powerful.
Peter Høyer and Robert Špalek.
Theory of Computing,
1(5):83101, 2005.

quantph/0208043 
Master's and Doctoral theses:  
Quantum Algorithms, Lower Bounds, and TimeSpace Tradeoffs.
CWI, Amsterdam, and ILLC, Universiteit van Amsterdam, 2006.
ISBN 9789057761553.

+NL 
Quantum Circuits with Unbounded Fanout.
Faculty of Sciences, Vrije Universiteit, Amsterdam, 2002.


Space Complexity of Quantum Computation.
Faculty of Mathematics and Physics, Charles University, Prague, 2002.

Abstracts of my papers, my bibliography items, and my older nonscientific texts are listed in separate documents.