| On the cut dimension of a graph | 0 | 0.34 | 2021 |
| Quantum algorithms for graph problems with cut queries | 1 | 0.35 | 2021 |
| Total Functions In Qma | 0 | 0.34 | 2021 |
| Strategies for quantum races. | 1 | 0.36 | 2019 |
| A New Public-Key Cryptosystem via Mersenne Numbers. | 2 | 0.38 | 2018 |
| On the randomised query complexity of composition. | 1 | 0.35 | 2018 |
| Linear-Time Algorithm for Quantum 2SAT. | 0 | 0.34 | 2018 |
| A composition theorem for randomized query complexity via max conflict complexity. | 0 | 0.34 | 2018 |
| Quantum generalizations of the polynomial hierarchy with applications to QMA(2). | 0 | 0.34 | 2018 |
| Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing | 7 | 0.45 | 2017 |
| On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. | 2 | 0.36 | 2017 |
| Solving systems of diagonal polynomial equations over finite fields. | 0 | 0.34 | 2017 |
| Improved bounds for the randomized decision tree Complexity of recursive majority. | 0 | 0.34 | 2016 |
| On the complexity of probabilistic trials for hidden satisfiability problems. | 0 | 0.34 | 2016 |
| Linear time algorithm for quantum 2SAT | 1 | 0.41 | 2015 |
| Polynomial Interpolation and Identity Testing from High Powers over Finite Fields. | 1 | 0.41 | 2015 |
| An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. | 0 | 0.34 | 2014 |
| Polynomial time quantum algorithms for certain bivariate hidden polynomial problems | 1 | 0.35 | 2014 |
| On the Complexity of Trial and Error for Constraint Satisfaction Problems. | 3 | 0.41 | 2014 |
| Generalized Wong sequences and their applications to Edmonds' problems. | 7 | 0.75 | 2014 |
| Hidden Translation and Translating Coset in Quantum Computing. | 4 | 0.40 | 2014 |
| Improved bounds for the randomized decision tree complexity of recursive majority | 2 | 0.44 | 2013 |
| Hidden Symmetry Subgroup Problems. | 2 | 0.40 | 2013 |
| Improved quantum query algorithms for triangle finding and associativity testing | 2 | 0.38 | 2013 |
| New bounds on the classical and quantum communication complexity of some graph properties | 2 | 0.36 | 2012 |
| An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups | 6 | 0.47 | 2012 |
| On the Hitting Times of Quantum Versus Random Walks | 19 | 1.14 | 2012 |
| Query Complexity of Matroids. | 1 | 0.35 | 2012 |
| On the Power of a Unique Quantum Witness | 1 | 0.36 | 2012 |
| A learning graph based quantum query algorithm for finding constant-size subgraphs | 10 | 0.60 | 2011 |
| Search via Quantum Walk | 54 | 2.68 | 2011 |
| The complexity of approximate nash equilibrium in congestion games with negative delays | 1 | 0.37 | 2011 |
| Quantization of random walks: search algorithms and hitting time | 0 | 0.34 | 2010 |
| Optimal direct sum results for deterministic and randomized decision tree complexity | 5 | 0.53 | 2010 |
| On the hitting times of quantum versus random walks | 0 | 0.34 | 2009 |
| Quantum Testers for Hidden Group Properties | 3 | 0.39 | 2009 |
| Quantum and classical query complexities of local search are polynomially related | 9 | 0.67 | 2009 |
| Quantum walk based search algorithms | 29 | 1.51 | 2008 |
| Approximate Nash Equilibria for Multi-player Games | 16 | 0.84 | 2008 |
| An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups | 7 | 0.51 | 2007 |
| Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates | 12 | 1.11 | 2007 |
| Quantum Algorithms for the Triangle Problem | 78 | 4.29 | 2007 |
| Locally 2-dimensional sperner problems complete for the polynomial parity argument classes | 4 | 0.69 | 2006 |
| Quantum Algorithms for Element Distinctness | 45 | 4.05 | 2005 |
| Efficient testing of groups | 5 | 0.48 | 2005 |
| Hidden translation and orbit coset in quantum computing | 52 | 2.54 | 2003 |
| Approximate testing with error relative to input size | 1 | 0.36 | 2003 |
| Semantical Counting Circuits | 0 | 0.34 | 2003 |
| Quantum Testers for Hidden Group Properties | 5 | 0.60 | 2003 |
| Exact and approximate testing/correcting of algebraic functions: a survey | 10 | 0.64 | 2001 |
