Arithmetic circuits: A survey of recent results and open questions A Shpilka, A Yehudayoff Now Publishers Inc, 2010 | 377 | 2010 |

Lower bounds and separations for constant depth multilinear circuits R Raz, A Yehudayoff Computational Complexity 18 (2), 171-207, 2009 | 123 | 2009 |

Hardness-randomness tradeoffs for bounded depth arithmetic circuits Z Dvir, A Shpilka, A Yehudayoff SIAM Journal on Computing 39 (4), 1279-1293, 2010 | 75 | 2010 |

Pseudorandom generators for regular branching programs M Braverman, A Rao, R Raz, A Yehudayoff SIAM Journal on Computing 43 (3), 973-986, 2014 | 67 | 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 | 66 | 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 | 63 | 2008 |

Towards deterministic tree code constructions M Braverman Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012 | 62 | 2012 |

Sample compression schemes for VC classes S Moran, A Yehudayoff Journal of the ACM (JACM) 63 (3), 1-10, 2016 | 57 | 2016 |

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 | 53 | 2011 |

Balancing syntactically multilinear arithmetic circuits R Raz, A Yehudayoff Computational Complexity 17 (4), 515-535, 2008 | 53 | 2008 |

Affine extractors over prime fields A Yehudayoff Combinatorica 31 (2), 245-256, 2011 | 50 | 2011 |

Learnability can be undecidable S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff Nature Machine Intelligence 1 (1), 44-48, 2019 | 49 | 2019 |

Non-commutative circuits and the sum-of-squares problem P Hrubeš, A Wigderson, A Yehudayoff Journal of the American Mathematical Society 24 (3), 871-898, 2011 | 46 | 2011 |

Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors R Raz, A Yehudayoff Journal of Computer and System Sciences 77 (1), 167-190, 2011 | 45 | 2011 |

Learners that use little information R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff Algorithmic Learning Theory, 25-55, 2018 | 43 | 2018 |

Pseudorandomness for width-2 branching programs A Bogdanov, Z Dvir, E Verbin, A Yehudayoff Theory of Computing 9 (1), 283-293, 2013 | 39 | 2013 |

Direct product via round-preserving compression M Braverman, A Rao, O Weinstein, A Yehudayoff International Colloquium on Automata, Languages, and Programming, 232-243, 2013 | 33 | 2013 |

Homogeneous formulas and symmetric polynomials P Hrubeš, A Yehudayoff Computational Complexity 20 (3), 559-578, 2011 | 33 | 2011 |

Population recovery and partial identification A Wigderson, A Yehudayoff Machine Learning 102 (1), 29-56, 2016 | 32 | 2016 |

Expansion in SL _{2} and monotone expandersJ Bourgain, A Yehudayoff Geometric and Functional Analysis 23 (1), 1-41, 2013 | 32 | 2013 |