| Explicit lower bounds on strong simulation of quantum circuits in terms of $T$-gate count. | 1 | 0.38 | 2019 |
| Explicit Lower Bounds on Strong Quantum Simulation | 1 | 0.36 | 2018 |
| The Moser-Tardos Resample algorithm: Where is the limit? (an experimental inquiry). | 1 | 0.35 | 2017 |
| Streaming Algorithms for Independent Sets in Sparse Hypergraphs | 4 | 0.47 | 2016 |
| A Graph-based Model for GPU Caching Problems. | 0 | 0.34 | 2016 |
| Impossibility Theorems and the Universal Algebraic Toolkit | 1 | 0.37 | 2015 |
| An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game | 2 | 0.36 | 2015 |
| Digital Signatures with Minimal Overhead from Indifferentiable Random Invertible Functions. | 8 | 0.53 | 2013 |
| The Lovász Local Lemma - A Survey. | 4 | 0.48 | 2013 |
| The Garden Hose Complexity for the Equality Function. | 4 | 0.50 | 2013 |
| Streaming and communication complexity of clique approximation | 5 | 0.47 | 2012 |
| Mechanism design: from partial to probabilistic verification | 14 | 0.91 | 2012 |
| Digital Signatures with Minimal Overhead. | 1 | 0.36 | 2012 |
| A Sharper Local Lemma with Improved Applications. | 9 | 0.54 | 2012 |
| Moser and tardos meet Lovász | 21 | 0.85 | 2011 |
| Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday. | 0 | 0.34 | 2011 |
| Quantum Query Complexity of State Conversion | 54 | 2.06 | 2011 |
| Six-way equipartitioning by three lines in the plane | 0 | 0.34 | 2010 |
| Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles | 18 | 1.11 | 2009 |
| A new line of attack on the dichotomy conjecture | 12 | 0.64 | 2009 |
| Amortized Communication Complexity of Distributions | 2 | 0.39 | 2009 |
| Geometric representation of cubic graphs with four directions | 14 | 0.74 | 2009 |
| Quantum and classical query complexities of local search are polynomially related | 9 | 0.67 | 2009 |
| Parallel repetition of the odd cycle game | 3 | 0.55 | 2008 |
| Product Rules in Semidefinite Programming | 10 | 0.77 | 2007 |
| On the variance of subset sum estimation | 11 | 0.61 | 2007 |
| Quantum Algorithms for the Triangle Problem | 78 | 4.29 | 2007 |
| A dichotomy theorem for typed constraint satisfaction problems | 1 | 0.43 | 2006 |
| All Quantum Adversary Methods Are Equivalent | 33 | 1.61 | 2006 |
| Languages with Bounded Multiparty Communication Complexity | 0 | 0.34 | 2006 |
| The DLT priority sampling is essentially optimal | 25 | 1.02 | 2006 |
| The Quantum Adversary Method and Classical Formula Size Lower Bounds | 25 | 1.26 | 2005 |
| Near optimality of the priority sampling procedure | 5 | 0.60 | 2005 |
| Optimally balanced forward degree sequence | 0 | 0.34 | 2005 |
| Computing Boolean functions from multiple faulty copies of input bits | 5 | 0.49 | 2004 |
| Long monotone paths in line arrangements | 4 | 0.53 | 2004 |
| Quantum Speed-Up of Markov Chain Based Algorithms | 125 | 6.79 | 2004 |
| Quantum query complexity and semi-definite programming | 25 | 1.04 | 2003 |
| Tracking Join and Self-Join Sizes in Limited Storage | 140 | 33.97 | 2002 |
| Parent-identifying codes | 10 | 0.99 | 2001 |
| Regular Languages are Testable with a Constant Number of Queries | 66 | 4.11 | 2000 |
| Efficient Testing of Large Graphs | 2 | 0.37 | 2000 |
| Just the fax—differentiating voice and fax phone lines using call billing data | 1 | 0.35 | 1999 |
| A Slique Size Bounding Technique with Application to Non-Linear Codes. | 0 | 0.34 | 1999 |
| On-line complexity of monotone set systems | 0 | 0.34 | 1999 |
| Efficient Testing of Large Graphs. | 1 | 0.35 | 1999 |
| Many-Valued Logics and Holographic Proofs | 9 | 0.52 | 1999 |
| In how many steps the k peg version of the towers of Hanoi game can be solved? | 10 | 1.28 | 1999 |
| What are the Least Tractable Instances of max Tndependent Set? | 0 | 0.34 | 1999 |
| Large sets of nearly orthogonal vectors | 4 | 0.56 | 1999 |
