| 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 | 502 | 2010 |
| Communication Complexity: and Applications A Rao, A Yehudayoff Cambridge University Press, 2020 | 156 | 2020 |
| Lower bounds and separations for constant depth multilinear circuits R Raz, A Yehudayoff Computational Complexity 18, 171-207, 2009 | 145 | 2009 |
| Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019 | 120 | 2019 |
| Learners that use little information R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff Algorithmic Learning Theory, 25-55, 2018 | 107 | 2018 |
| 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 | 103 | 2008 |
| Sample compression schemes for VC classes S Moran, A Yehudayoff Journal of the ACM (JACM) 63 (3), 1-10, 2016 | 101 | 2016 |
| Pseudorandom generators for regular branching programs M Braverman, A Rao, R Raz, A Yehudayoff SIAM Journal on Computing 43 (3), 973-986, 2014 | 93 | 2014 |
| Direct products in communication complexity M Braverman, A Rao, O Weinstein, A Yehudayoff 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013 | 90 | 2013 |
| 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 | 72 | 2008 |
| Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes B Barak, Z Dvir, A Yehudayoff, A Wigderson Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 67 | 2011 |
| Balancing syntactically multilinear arithmetic circuits R Raz, A Yehudayoff Computational Complexity 17, 515-535, 2008 | 67 | 2008 |
| Affine extractors over prime fields A Yehudayoff Combinatorica 31 (2), 245-256, 2011 | 65 | 2011 |
| Sign rank versus VC dimension N Alon, S Moran, A Yehudayoff Conference on Learning Theory, 47-80, 2016 | 60* | 2016 |
| Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors R Raz, A Yehudayoff Journal of Computer and System Sciences 77 (1), 167-190, 2011 | 60 | 2011 |
| Non-commutative circuits and the sum-of-squares problem P Hrubeš, A Wigderson, A Yehudayoff Proceedings of the forty-second ACM symposium on Theory of computing, 667-676, 2010 | 55 | 2010 |
| A theory of universal learning O Bousquet, S Hanneke, S Moran, R Van Handel, A Yehudayoff Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 54 | 2021 |
| Separating multilinear branching programs and formulas Z Dvir, G Malod, S Perifel, A Yehudayoff Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 53 | 2012 |
| Pseudorandomness for width-2 branching programs A Bogdanov, Z Dvir, E Verbin, A Yehudayoff Theory of Computing 9 (1), 283-293, 2013 | 49 | 2013 |
| Homogeneous formulas and symmetric polynomials P Hrubeš, A Yehudayoff Computational Complexity 20 (3), 559-578, 2011 | 48 | 2011 |
Anup RaoProfessor of Computer Science, University of WashingtonVerified email at cs.washington.edu
