| Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree | 0 | 0.34 | 2020 |
| The Complexity of Finding {$S$}-factors in Regular Graphs. | 0 | 0.34 | 2019 |
| A story of AM and Unique-SAT. | 0 | 0.34 | 2018 |
| The Power of Natural Properties as Oracles. | 0 | 0.34 | 2018 |
| Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. | 1 | 0.35 | 2017 |
| On Some Computations on Sparse Polynomials. | 0 | 0.34 | 2017 |
| A Guide to Learning Arithmetic Circuits. | 0 | 0.34 | 2016 |
| Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials. | 1 | 0.35 | 2015 |
| Deterministic polynomial identity tests for multilinear bounded-read formulae | 5 | 0.44 | 2015 |
| Read-once polynomial identity testing | 27 | 0.90 | 2015 |
| On Learning, Lower Bounds and (un)Keeping Promises. | 0 | 0.34 | 2014 |
| On Reconstruction and Testing of Read-Once Formulas. | 5 | 0.45 | 2014 |
| Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in | 17 | 0.63 | 2013 |
| Black-Box Identity Testing of Depth-4 Multilinear Circuits | 18 | 0.65 | 2011 |
| Derandomizing Polynomial Identity Testing for Multilinear Constant-Read Formulae | 15 | 0.63 | 2011 |
| On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors | 21 | 0.92 | 2010 |
| Improved Polynomial Identity Testing for Read-Once Formulas | 35 | 0.98 | 2009 |
