| Hitting Sets for Orbits of Circuit Classes and Polynomial Families. | 0 | 0.34 | 2021 |
| Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits | 5 | 0.42 | 2020 |
| A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. | 0 | 0.34 | 2020 |
| Learning sums of powers of low-degree polynomials in the non-degenerate case | 1 | 0.35 | 2020 |
| Determinant Equivalence Test over Finite Fields and over Q. | 0 | 0.34 | 2019 |
| Determinant equivalence test over finite fields and over $\mathbf{Q}$. | 0 | 0.34 | 2019 |
| On the Symmetries of and Equivalence Test for Design Polynomials. | 0 | 0.34 | 2019 |
| Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds. | 0 | 0.34 | 2018 |
| Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs. | 0 | 0.34 | 2018 |
| Reconstruction of non-degenerate homogeneous depth three circuits. | 1 | 0.35 | 2018 |
| On the symmetries of design polynomials. | 0 | 0.34 | 2018 |
| Reconstruction of full rank Algebraic Branching Programs. | 0 | 0.34 | 2017 |
| On the size of homogeneous and of depth four formulas with low individual degree. | 2 | 0.38 | 2016 |
| An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. | 0 | 0.34 | 2016 |
| Multi-k-ic Depth Three Circuit Lower Bound. | 1 | 0.35 | 2015 |
| Lower Bounds for Sums of Products of Low arity Polynomials. | 1 | 0.36 | 2015 |
| Lower Bounds for Sums of Powers of Low Degree Univariates. | 5 | 0.53 | 2015 |
| Lower Bounds for Depth Three Arithmetic Circuits with small bottom fanin. | 4 | 0.41 | 2015 |
| An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas | 21 | 0.75 | 2014 |
| Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas | 9 | 0.54 | 2014 |
| Fast Integer Multiplication Using Modular Arithmetic. | 1 | 0.35 | 2013 |
| Quasi-polynomial hitting-set for set-depth-Δ formulas | 22 | 0.67 | 2013 |
| A super-polynomial lower bound for regular arithmetic formulas | 27 | 1.03 | 2013 |
| On the Sum of Square Roots of Polynomials and Related Problems | 6 | 0.44 | 2012 |
| Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant | 0 | 0.34 | 2011 |
| Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits | 21 | 0.67 | 2011 |
| A Case of Depth-3 Identity Testing, Sparse Factorization and Duality | 8 | 0.45 | 2011 |
| The Power of Depth 2 Circuits over Algebras. | 0 | 0.34 | 2009 |
| Fast integer multiplication using modular arithmetic | 14 | 0.90 | 2008 |
| Factoring Polynomials over Finite Fields using Balance Test | 1 | 0.36 | 2008 |
| Covering a Set of Points in a Plane Using Two Parallel Rectangles | 7 | 0.52 | 2007 |
| Simpler algorithm for estimating frequency moments of data streams | 59 | 2.10 | 2006 |
| Practical algorithms for tracking database join sizes | 11 | 0.91 | 2005 |
