| Arithmetic circuits: A survey of recent results and open questions A Shpilka, A Yehudayoff Foundations and Trends® in Theoretical Computer Science 5 (3–4), 207-388, 2010 | 520 | 2010 |
| Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits Z Dvir, A Shpilka Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 197 | 2005 |
| Deterministic polynomial identity testing in non-commutative models R Raz, A Shpilka computational complexity 14, 1-19, 2005 | 194 | 2005 |
| Depth-3 arithmetic circuits over fields of characteristic zero A Shpilka, A Wigderson Computational Complexity 10 (1), 1-27, 2001 | 165 | 2001 |
| On epsilon-Biased Generators in NC^ 0 E Mossel, A Shpilka, L Trevisan Annual Symposium on Foundations of Computer Science 44, 136-145, 2003 | 162 | 2003 |
| Strong lower bounds for approximating distribution support size and the distinct elements problem S Raskhodnikova, D Ron, A Shpilka, A Smith SIAM Journal on Computing 39 (3), 813-842, 2009 | 159 | 2009 |
| Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019 | 146* | 2019 |
| Testing Fourier dimensionality and sparsity P Gopalan, R O'Donnell, RA Servedio, A Shpilka, K Wimmer SIAM Journal on Computing 40 (4), 1075-1100, 2011 | 121 | 2011 |
| Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs MA Forbes, A Shpilka 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 243-252, 2013 | 117 | 2013 |
| Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ZS Karnin, A Shpilka 2008 23rd Annual IEEE Conference on Computational Complexity, 280-291, 2008 | 109 | 2008 |
| Hardness-randomness tradeoffs for bounded depth arithmetic circuits Z Dvir, A Shpilka, A Yehudayoff Proceedings of the fortieth annual ACM symposium on Theory of computing, 741-748, 2008 | 105 | 2008 |
| Reed-Muller codes for random erasures and errors E Abbe, A Shpilka, A Wigderson Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015 | 101 | 2015 |
| Read-once polynomial identity testing A Shpilka, I Volkovich Proceedings of the fortieth annual ACM symposium on Theory of computing, 507-516, 2008 | 98 | 2008 |
| Reed–Muller codes: Theory and algorithms E Abbe, A Shpilka, M Ye IEEE Transactions on Information Theory 67 (6), 3251-3277, 2020 | 97 | 2020 |
| On sunflowers and matrix multiplication N Alon, A Shpilka, C Umans 2012 IEEE 27th Conference on Computational Complexity, 214-223, 2012 | 96 | 2012 |
| Hitting sets for multilinear read-once algebraic branching programs, in any order MA Forbes, R Saptharishi, A Shpilka Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 83* | 2014 |
| Explicit Noether normalization for simultaneous conjugation via polynomial identity testing MA Forbes, A Shpilka International Workshop on Approximation Algorithms for Combinatorial …, 2013 | 80 | 2013 |
| Improved polynomial identity testing for read-once formulas A Shpilka, I Volkovich International Workshop on Approximation Algorithms for Combinatorial …, 2009 | 77 | 2009 |
| Learning restricted models of arithmetic circuits A Klivans, A Shpilka Theory of computing 2 (1), 185-206, 2006 | 73* | 2006 |
| A lower bound for the size of syntactically multilinear arithmetic circuits R Raz, A Shpilka, A Yehudayoff SIAM Journal on Computing 38 (4), 1624-1647, 2008 | 71 | 2008 |
Elchanan MosselProfessor of Mathematics, MITE-mail megerősítve itt: mit.edu