| Parameterized Quantum Query Complexity of Graph Collision | 2 | 0.51 | 2013 |
| Quantum strategies are better than classical in almost any XOR game | 1 | 0.41 | 2012 |
| Search by quantum walks on two-dimensional grid without amplitude amplification | 6 | 0.93 | 2011 |
| Boolean functions with a low polynomial degree and quantum query algorithms | 1 | 0.35 | 2005 |
| Size of Nondeterministic and Deterministic Automata for Certain Languages | 0 | 0.34 | 2005 |
| Boolean Functions with a Low Polynomial Degree | 0 | 0.34 | 2004 |
