| TARGETED PSEUDORANDOM GENERATORS, SIMULATION ADVICE GENERATORS, AND DERANDOMIZING LOGSPACE | 0 | 0.34 | 2022 |
| Fast Multivariate Multipoint Evaluation Over All Finite Fields | 1 | 0.47 | 2022 |
| Fast Generalized DFTs for all Finite Groups | 0 | 0.34 | 2019 |
| Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411). | 0 | 0.34 | 2018 |
| A fast generalized DFT for finite groups of Lie type. | 0 | 0.34 | 2018 |
| Which groups are amenable to proving exponent two for matrix multiplication? | 2 | 0.47 | 2017 |
| On Multidimensional and Monotone k-SUM. | 0 | 0.34 | 2017 |
| Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace. | 1 | 0.36 | 2017 |
| Algebraic Problems Equivalent to Beating Exponent 3/2 for Polynomial Factorization over Finite Fields. | 0 | 0.34 | 2016 |
| On cap sets and the group-theoretic approach to matrix multiplication. | 0 | 0.34 | 2016 |
| The Power of Quantum Fourier Sampling | 4 | 0.46 | 2015 |
| Special Issue "Conference on Computational Complexity 2013" Guest editor's foreword | 0 | 0.34 | 2014 |
| Algebra in Computational Complexity (Dagstuhl Seminar 14391). | 0 | 0.34 | 2014 |
| On beating the hybrid argument | 3 | 0.41 | 2013 |
| Fast matrix multiplication using coherent configurations | 11 | 1.47 | 2012 |
| Better Condensers and New Extractors from Parvaresh-Vardy Codes | 4 | 0.43 | 2012 |
| Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). | 0 | 0.34 | 2012 |
| Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009). | 0 | 0.34 | 2012 |
| Special Section On Foundations of Computer Science | 0 | 0.34 | 2011 |
| On sunflowers and matrix multiplication | 8 | 1.49 | 2011 |
| Fast polynomial factorization and modular composition. | 29 | 1.08 | 2011 |
| The complexity of Boolean formula minimization | 16 | 0.74 | 2011 |
| Pseudorandom generators and the BQP vs. PH problem | 6 | 0.55 | 2010 |
| Inapproximability for VCG-based combinatorial auctions | 30 | 1.33 | 2010 |
| Improved inapproximability factors for some Sigma2p minimization problems. | 0 | 0.34 | 2009 |
| The complexity of the matroid–greedoid partition problem | 2 | 0.37 | 2009 |
| Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes | 143 | 5.11 | 2009 |
| Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms | 3 | 0.41 | 2009 |
| The Complexity of Rationalizing Network Formation | 1 | 0.36 | 2009 |
| Reconstructive Dispersers and Hitting Set Generators | 3 | 0.38 | 2009 |
| The Complexity of Rationalizing Matchings | 6 | 0.60 | 2008 |
| Fast Modular Composition in any Characteristic | 25 | 1.26 | 2008 |
| Fast polynomial factorization and modular composition in small characteristic | 15 | 0.76 | 2008 |
| Lossless Condensers, Unbalanced Expanders, And Extractors | 50 | 1.87 | 2007 |
| Algorithms for Playing Games with Limited Randomness | 6 | 0.54 | 2007 |
| Low-end uniform hardness vs. randomness tradeoffs for AM | 7 | 0.43 | 2007 |
| Complexity of two-level logic minimization | 38 | 1.50 | 2006 |
| Optimization problems in the polynomial-time hierarchy | 0 | 0.34 | 2006 |
| Better lossless condensers through derandomized curve samplers | 5 | 0.54 | 2006 |
| Pseudorandomness for approximate counting and sampling | 27 | 0.90 | 2006 |
| Group-theoretic Algorithms for Matrix Multiplication | 30 | 2.95 | 2006 |
| On Obtaining Pseudorandomness from Error-Correcting Codes | 3 | 0.50 | 2006 |
| Extractors and condensers from univariate polynomials | 2 | 0.44 | 2006 |
| Simple extractors for all min-entropies and a new pseudorandom generator | 94 | 3.51 | 2005 |
| On the Complexity of Succinct Zero-Sum Games | 17 | 1.03 | 2004 |
| A Group-Theoretic Approach to Fast Matrix Multiplication | 44 | 4.79 | 2003 |
| Pseudo-random generators for all hardnesses | 49 | 1.61 | 2002 |
| Loss-less condensers, unbalanced expanders, and extractors | 74 | 3.18 | 2001 |
| On the complexity of approximating the VC dimension | 17 | 1.15 | 2001 |
| Hardness of Approximating Sigma2p Minimization Problems | 16 | 1.14 | 1999 |
