1. Quantum Separation of Local Search and Fixed Point Computation;Algorithmica;2009-02-25
2. Quantum multiparty communication complexity and circuit lower bounds;Mathematical Structures in Computer Science;2009-02
3. Polynomial degree vs. quantum query complexity;Journal of Computer and System Sciences;2006-03
4. Lower Bounds Using Kolmogorov Complexity;Logical Approaches to Computational Barriers;2006
5. Quantum computing, postselection, and probabilistic polynomial-time;Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences;2005-09-05