| 2026 | STOC | Better Neural Network Expressivity: Subdividing the Simplex. | Egor Bakaev, Florestan Brunck, Christoph Hertrich, Jack Stade, Amir Yehudayoff |
| 2026 | STOC | Negations Are Powerful Even in Small Depth. | Bruno Cavalar, Tho Borm Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff |
| 2025 | COLT | Data Selection for ERMs. | Steve Hanneke, Shay Moran, Alexander Shlimovich, Amir Yehudayoff |
| 2025 | COLT | Open Problem: Data Selection for Regression Tasks. | Steve Hanneke, Shay Moran, Alexander Shlimovich, Amir Yehudayoff |
| 2024 | AISTATS | The sample complexity of ERMs in stochastic convex optimization. | Daniel Carmon, Amir Yehudayoff, Roi Livni |
| 2024 | COLT | Dual VC Dimension Obstructs Sample Compression by Embeddings. | Zachary Chase, Bogdan Chornomaz, Steve Hanneke, Shay Moran, Amir Yehudayoff |
| 2024 | COLT | A Unified Characterization of Private Learnability via Graph Theory. | Noga Alon, Shay Moran, Hilla Schefler, Amir Yehudayoff |
| 2024 | STOC | Local Borsuk-Ulam, Stability, and Replicability. | Zachary Chase, Bogdan Chornomaz, Shay Moran, Amir Yehudayoff |
| 2023 | FOCS | Stability and Replicability in Learning. | Zachary Chase, Shay Moran, Amir Yehudayoff |
| 2022 | FOCS | A Characterization of Multiclass Learnability. | Nataly Brukhim, Daniel Carmon, Irit Dinur, Shay Moran, Amir Yehudayoff |
| 2021 | STOC | Learnability can be independent of set theory (invited paper). | Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2021 | STOC | A theory of universal learning. | Olivier Bousquet, Steve Hanneke, Shay Moran, Ramon van Handel, Amir Yehudayoff |
| 2020 | CiE | On the Perceptron's Compression. | Shay Moran, Ido Nachum, Itai Panasoff, Amir Yehudayoff |
| 2020 | LATIN | On Symmetry and Initialization for Neural Networks. | Ido Nachum, Amir Yehudayoff |
| 2019 | ALT | Average-Case Information Complexity of Learning. | Ido Nachum, Amir Yehudayoff |
| 2019 | COLT | On Communication Complexity of Classification Problems. | Daniel Kane, Roi Livni, Shay Moran, Amir Yehudayoff |
| 2019 | ICALP | Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. | Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff |
| 2019 | IJCAI | On Division Versus Saturation in Pseudo-Boolean Solving. | Stephan Gocht, Jakob Nordstrm, Amir Yehudayoff |
| 2019 | STOC | Separating monotone VP and VNP. | Amir Yehudayoff |
| 2018 | ALT | Learners that Use Little Information. | Raef Bassily, Shay Moran, Ido Nachum, Jonathan Shafer, Amir Yehudayoff |
| 2018 | COLT | A Direct Sum Result for the Information Complexity of Learning. | Ido Nachum, Jonathan Shafer, Amir Yehudayoff |
| 2017 | FOGA | On the Statistical Learning Ability of Evolution Strategies. | Ofer M. Shir, Amir Yehudayoff |
| 2016 | COLT | Sign rank versus VC dimension. | Noga Alon, Shay Moran, Amir Yehudayoff |
| 2016 | GECCO | On the Capacity of Evolution Strategies to Statistically Learn the Landscape. | Ofer M. Shir, Jonathan Roslund, Amir Yehudayoff |
| 2016 | ICALP | On Isoperimetric Profiles and Computational Complexity. | Pavel Hrubes, Amir Yehudayoff |
| 2016 | ITA | Sample compression schemes for VC classes. | Shay Moran, Amir Yehudayoff |
| 2016 | SIROCCO | Fooling Pairs in Randomized Communication Complexity. | Shay Moran, Makrand Sinha, Amir Yehudayoff |
| 2015 | FOCS | Compressing and Teaching for Low VC-Dimension. | Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff |
| 2014 | ICALP | Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. | Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff |
| 2013 | FOCS | Direct Products in Communication Complexity. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | ICALP | Direct Product via Round-Preserving Compression. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2012 | FOCS | Population Recovery and Partial Identification. | Avi Wigderson, Amir Yehudayoff |
| 2012 | STOC | Monotone expansion. | Jean Bourgain, Amir Yehudayoff |
| 2012 | STOC | Separating multilinear branching programs and formulas. | Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff |
| 2011 | STOC | Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. | Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson |
| 2010 | FOCS | Pseudorandom Generators for Regular Branching Programs. | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
| 2010 | STOC | Non-commutative circuits and the sum-of-squares problem. | Pavel Hrubes, Avi Wigderson, Amir Yehudayoff |
| 2008 | FOCS | Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. | Ran Raz, Amir Yehudayoff |
| 2008 | STOC | Hardness-randomness tradeoffs for bounded depth arithmetic circuits. | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
| 2007 | FOCS | A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. | Ran Raz, Amir Shpilka, Amir Yehudayoff |