| Quantum Distributed Complexity of Set Disjointness on a Line | 0 | 0.34 | 2022 |
| Quantum Time-Space Tradeoff for Finding Multiple Collision Pairs. | 0 | 0.34 | 2021 |
| Quantum Distributed Complexity of Set Disjointness on a Line | 0 | 0.34 | 2020 |
| Extended Learning Graphs for Triangle Finding | 1 | 0.35 | 2020 |
| Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. | 0 | 0.34 | 2020 |
| Improved bounds for testing Dyck languages. | 0 | 0.34 | 2018 |
| Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks. | 0 | 0.34 | 2018 |
| Quantum Chebyshev's Inequality and Applications. | 0 | 0.34 | 2018 |
| Improved Quantum Query Algorithms for Triangle Detection and Associativity Testing | 7 | 0.45 | 2017 |
| Streaming Communication Protocols. | 0 | 0.34 | 2016 |
| Quantum walks can find a marked element on any graph | 13 | 0.89 | 2016 |
| Improved bounds for the randomized decision tree Complexity of recursive majority. | 0 | 0.34 | 2016 |
| Streaming Property Testing of Visibly Pushdown Languages | 0 | 0.34 | 2016 |
| Streaming Property Testing of Visibly Pushdown Languages. | 2 | 0.38 | 2015 |
| Stable Matching with Evolving Preferences | 2 | 0.43 | 2015 |
| Unidirectional Input/Output Streaming Complexity of Reversal and Sorting. | 1 | 0.36 | 2014 |
| Hidden Translation and Translating Coset in Quantum Computing. | 4 | 0.40 | 2014 |
| Some approximations in Model Checking and Testing | 0 | 0.34 | 2013 |
| Nested quantum walks with quantum data structures | 12 | 0.61 | 2013 |
| Input/Output Streaming Complexity of Reversal and Sorting. | 0 | 0.34 | 2013 |
| Time-Efficient quantum walks for 3-distinctness | 5 | 0.42 | 2013 |
| A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates | 2 | 0.40 | 2013 |
| Improved bounds for the randomized decision tree complexity of recursive majority | 2 | 0.44 | 2013 |
| Optimal Parallel Quantum Query Algorithms. | 0 | 0.34 | 2013 |
| Improved quantum query algorithms for triangle finding and associativity testing | 2 | 0.38 | 2013 |
| Streaming Complexity of Checking Priority Queues | 3 | 0.40 | 2012 |
| Improving quantum query complexity of boolean matrix multiplication using graph collision | 6 | 0.65 | 2012 |
| On the Hitting Times of Quantum Versus Random Walks | 19 | 1.14 | 2012 |
| Validating XML documents in the streaming model with external memory | 8 | 0.54 | 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 |
| Maximum Matching in Semi-Streaming with Few Passes | 26 | 0.86 | 2011 |
| The complexity of approximate nash equilibrium in congestion games with negative delays | 1 | 0.37 | 2011 |
| Finding is as easy as detecting for quantum walks | 12 | 1.14 | 2010 |
| Approximate Satisfiability and Equivalence | 14 | 0.68 | 2010 |
| The Streaming Complexity of Validating XML Documents | 1 | 0.36 | 2010 |
| On the hitting times of quantum versus random walks | 0 | 0.34 | 2009 |
| Recognizing Well-Parenthesized Expressions in the Streaming Model. | 21 | 0.76 | 2009 |
| Quantum Testers for Hidden Group Properties | 3 | 0.39 | 2009 |
| Foreword from the Guest Editors | 0 | 0.34 | 2009 |
| Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments | 33 | 1.58 | 2008 |
| Quantum Complexity of Testing Group Commutativity | 20 | 1.14 | 2007 |
| Property Testing of Regular Tree Languages | 10 | 0.64 | 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 |
| Self-testing of quantum circuits | 12 | 0.98 | 2006 |
| Quantum Algorithms for Element Distinctness | 45 | 4.05 | 2005 |
| Multi-linearity Self-Testing with Relative Error | 3 | 0.41 | 2005 |
| Property and Equivalence Testing on Strings | 1 | 0.35 | 2004 |
| Hidden translation and orbit coset in quantum computing | 52 | 2.54 | 2003 |
