Balancing Syntactically Multilinear Arithmetic Circuits. - Ran Raz; Amir Yehudayoff (Comput. Complex., 2008)

t-Wise independence with local dependencies. - Ronen Gradwohl; Amir Yehudayoff (Inf. Process. Lett., 2008)

A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. - Ran Raz; Amir Shpilka; Amir Yehudayoff (SIAM J. Comput., 2008)

Lower Bounds and Separations for Constant Depth Multilinear Circuits. - Ran Raz; Amir Yehudayoff (Comput. Complex., 2009)

Pseudorandomness for Width 2 Branching Programs. - Andrej Bogdanov; Zeev Dvir; Elad Verbin; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2009)

Monotone separations for constant degree polynomials. - Pavel Hrubes; Amir Yehudayoff (Inf. Process. Lett., 2009)

Players' Effects Under Limited Independence. - Ronen Gradwohl; Omer Reingold; Ariel Yadin; Amir Yehudayoff (Math. Oper. Res., 2009)

Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. - Zeev Dvir; Amir Shpilka; Amir Yehudayoff (SIAM J. Comput., 2009)

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. - Boaz Barak; Zeev Dvir; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

Non-commutative circuits and the sum-of-squares problem. - Pavel Hrubes; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

Relationless completeness and separations. - Pavel Hrubes; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

Arithmetic Circuits: A survey of recent results and open questions. - Amir Shpilka; Amir Yehudayoff (Found. Trends Theor. Comput. Sci., 2010)

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. - Boaz Barak; Zeev Dvir; Amir Yehudayoff; Avi Wigderson (STOC, 2011)

Homogeneous Formulas and Symmetric Polynomials. - Pavel Hrubes; Amir Yehudayoff (Comput. Complex., 2011)

Affine extractors over prime fields. - Amir Yehudayoff (Comb., 2011)

Separating multilinear branching programs and formulas. - Zeev Dvir; Guillaume Malod; Sylvain Perifel; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Restriction Access. - Zeev Dvir; Anup Rao 001; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. - Ran Raz; Amir Yehudayoff (J. Comput. Syst. Sci., 2011)

The maximal probability that k-wise independent bits are all 1. - Ron Peled; Ariel Yadin; Amir Yehudayoff (Random Struct. Algorithms, 2011)

Arithmetic Complexity in Ring Extensions. - Pavel Hrubes; Amir Yehudayoff (Theory Comput., 2011)

Monotone expansion. - Jean Bourgain; Amir Yehudayoff (STOC, 2012)

Linear cover time for trees is exponentially unlikely. - Amir Yehudayoff (Chic. J. Theor. Comput. Sci., 2012)

Direct Products in Communication Complexity. - Mark Braverman; Anup Rao 001; Omri Weinstein; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2012)

Formulas are exponentially stronger than monotone circuits in non-commutative setting. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2012)

Proving expansion in three steps. - Amir Yehudayoff (SIGACT News, 2012)

Lipschitz Functions on Expanders are Typically Flat. - Ron Peled; Wojciech Samotij; Amir Yehudayoff (Comb. Probab. Comput., 2013)

Direct product via round-preserving compression. - Mark Braverman; Anup Rao 001; Omri Weinstein; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2013)

Direct Sum Fails for Zero Error Average Communication. - Gillat Kol; Shay Moran; Amir Shpilka; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2013)

A note on average-case sorting. - Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2013)

Inequalities and tail bounds for elementary symmetric polynomial. - Parikshit Gopalan; Amir Yehudayoff (CoRR, 2014)

Sign rank, VC dimension and spectral gaps. - Noga Alon; Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Internal compression of protocols to entropy. - Balthazar Bauer; Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Inequalities and tail bounds for elementary symmetric polynomials. - Parikshit Gopalan; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Fooling Pairs in Randomized Communication Complexity. - Shay Moran; Makrand Sinha; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. - Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2014)

Pseudorandom Generators for Regular Branching Programs. - Mark Braverman; Anup Rao 001; Ran Raz; Amir Yehudayoff (SIAM J. Comput., 2014)

Compressing and Teaching for Low VC-Dimension. - Shay Moran; Amir Shpilka; Avi Wigderson; Amir Yehudayoff (FOCS, 2015)

Geometric stability via information theory. - David Ellis; Ehud Friedgut; Guy Kindler; Amir Yehudayoff (CoRR, 2015)

On isoperimetric profiles and computational complexity. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2015)

Teaching and compressing for low VC-dimension. - Shay Moran; Amir Shpilka; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2015)

Proper PAC learning is compressing. - Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2015)

Sign rank versus VC dimension. - Noga Alon; Shay Moran; Amir Yehudayoff (COLT, 2016)

On the Capacity of Evolution Strategies to Statistically Learn the Landscape. - Ofer M. Shir; Jonathan Roslund; Amir Yehudayoff (GECCO (Companion), 2016)

Supervised learning through the lens of compression. - Ofir David; Shay Moran; Amir Yehudayoff (NIPS, 2016)

On statistical learning via the lens of compression. - Ofir David; Shay Moran; Amir Yehudayoff (CoRR, 2016)

On the Theoretical Capacity of Evolution Strategies to Statistically Learn the Landscape Hessian. - Ofer M. Shir; Jonathan Roslund; Amir Yehudayoff (CoRR, 2016)

Pointer chasing via triangular discrimination. - Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2016)

Sample Compression Schemes for VC Classes. - Shay Moran; Amir Yehudayoff (J. ACM, 2016)

Population recovery and partial identification. - Avi Wigderson; Amir Yehudayoff (Mach. Learn., 2016)

On the Statistical Learning Ability of Evolution Strategies. - Ofer M. Shir; Amir Yehudayoff (FOGA, 2017)

Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues. - Noga Alon; Moshe Babaioff; Yannai A. Gonczarowski; Yishay Mansour; Shay Moran; Amir Yehudayoff (NIPS, 2017)

Learners that Leak Little Information. - Raef Bassily; Shay Moran; Ido Nachum; Jonathan Shafer; Amir Yehudayoff (CoRR, 2017)

A learning problem that is independent of the set theory ZFC axioms. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (CoRR, 2017)

An Elementary Exposition of Topological Overlap in the Plane. - Amir Yehudayoff (Discret. Comput. Geom., 2017)

On Communication Complexity of Classification Problems. - Daniel M. Kane; Roi Livni; Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2017)

Learners that Use Little Information. - Raef Bassily; Shay Moran; Ido Nachum; Jonathan Shafer; Amir Yehudayoff (ALT, 2018)

A Direct Sum Result for the Information Complexity of Learning. - Ido Nachum; Jonathan Shafer; Amir Yehudayoff (COLT, 2018)

Distributed construction of purely additive spanners. - Keren Censor-Hillel; Telikepalli Kavitha; Ami Paz; Amir Yehudayoff (Distributed Comput., 2018)

On the Communication Complexity of Key-Agreement Protocols. - Iftach Haitner; Noam Mazor; Rotem Oshman; Omer Reingold; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Separating Monotone VP and VNP. - Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Anti-concentration in most directions. - Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2018)

Average-Case Information Complexity of Learning. - Ido Nachum; Amir Yehudayoff (ALT, 2019)

On Weak epsilon-Nets and the Radon Number. - Shay Moran; Amir Yehudayoff (SoCG, 2019)

On Division Versus Saturation in Pseudo-Boolean Solving. - Stephan Gocht; Jakob Nordström; Amir Yehudayoff (IJCAI, 2019)

Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. - Gillat Kol; Shay Moran; Amir Shpilka; Amir Yehudayoff (Comput. Complex., 2019)

Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. - Pavel Hrubes; Sivaramakrishnan Natarajan Ramamoorthy; Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2019)

Learnability can be undecidable. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (Nat. Mach. Intell., 2019)

Author Correction: Learnability can be undecidable. - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (Nat. Mach. Intell., 2019)

On the Perceptron's Compression. - Shay Moran; Ido Nachum; Itai Panasoff; Amir Yehudayoff (CiE, 2020)

On Symmetry and Initialization for Neural Networks. - Ido Nachum; Amir Yehudayoff (LATIN, 2020)

On Weak ε-Nets and the Radon Number. - Shay Moran; Amir Yehudayoff (Discret. Comput. Geom., 2020)

Interactive Proofs for Verifying Machine Learning. - Shafi Goldwasser; Guy N. Rothblum; Jonathan Shafer; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

Shadows of Newton polytopes. - Pavel Hrubes; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

The Communication Complexity of the Exact Gap-Hamming Problem. - Anup Rao 001; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

On the covariance-Hessian relation in evolution strategies. - Ofer M. Shir; Amir Yehudayoff (Theor. Comput. Sci., 2020)

Concentration for Limited Independence via Inequalities for the Elementary Symmetric Polynomials. - Parikshit Gopalan; Amir Yehudayoff (Theory Comput., 2020)

Learnability can be independent of set theory (invited paper). - Shai Ben-David; Pavel Hrubes; Shay Moran; Amir Shpilka; Amir Yehudayoff (STOC, 2021)

A theory of universal learning. - Olivier Bousquet; Steve Hanneke; Shay Moran; Ramon van Handel; Amir Yehudayoff (STOC, 2021)

Slicing the hypercube is not easy. - Gal Yehuda; Amir Yehudayoff (CoRR, 2021)

Regularization by Misclassification in ReLU Neural Networks. - Elisabetta Cornacchia; Jan Hazla; Ido Nachum; Amir Yehudayoff (CoRR, 2021)

Explicit Exponential Lower Bounds for Exact Hyperplane Covers. - Benjamin E. Diamond; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2021)

Tight bounds on the Fourier growth of bounded functions on the hypercube. - Siddharth Iyer; Anup Rao 001; Victor Reis; Thomas Rothvoss; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2021)

An Isoperimetric Inequality for Hamming Balls and Local Expansion in Hypercubes. - Zilin Jiang; Amir Yehudayoff (Electron. J. Comb., 2022)

A Characterization of Multiclass Learnability. - Nataly Brukhim; Daniel Carmon; Irit Dinur; Shay Moran; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2022)

Anticoncentration and the Exact Gap-Hamming Problem. - Anup Rao 001; Amir Yehudayoff (SIAM J. Discret. Math., 2022)

Stability and Replicability in Learning. - Zachary Chase 001; Shay Moran; Amir Yehudayoff (FOCS, 2023)

Replicability and stability in learning. - Zachary Chase 001; Shay Moran; Amir Yehudayoff (CoRR, 2023)

The discrepancy of greater-than. - Srikanth Srinivasan 001; Amir Yehudayoff (CoRR, 2023)

The sample complexity of ERMs in stochastic convex optimization. - Daniel Carmon; Amir Yehudayoff; Roi Livni (AISTATS, 2024)

Dual VC Dimension Obstructs Sample Compression by Embeddings. - Zachary Chase 001; Bogdan Chornomaz; Steve Hanneke; Shay Moran; Amir Yehudayoff (COLT, 2024)

A Unified Characterization of Private Learnability via Graph Theory. - Noga Alon; Shay Moran; Hilla Schefler; Amir Yehudayoff (COLT, 2024)

Local Borsuk-Ulam, Stability, and Replicability. - Zachary Chase 001; Bogdan Chornomaz; Shay Moran; Amir Yehudayoff (STOC, 2024)

On Blocky Ranks Of Matrices. - Daniel Avraham; Amir Yehudayoff (Comput. Complex., 2024)

A Lower Bound for Essential Covers of the Cube. - Gal Yehuda; Amir Yehudayoff (Comb., 2024)

Data Selection for ERMs. - Steve Hanneke; Shay Moran; Alexander Shlimovich; Amir Yehudayoff (COLT, 2025)

Open Problem: Data Selection for Regression Tasks. - Steve Hanneke; Shay Moran; Alexander Shlimovich; Amir Yehudayoff (COLT, 2025)

The Algebraic Cost of a Boolean Sum. - Ian Orzel; Srikanth Srinivasan 001; Sébastien Tavenas; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2025)

On the Space Complexity of Online Convolution. - Joel Daniel Andersson; Amir Yehudayoff (CoRR, 2025)

On the Depth of Monotone ReLU Neural Networks and ICNNs. - Egor Bakaev; Florestan Brunck; Christoph Hertrich; Daniel Reichman 001; Amir Yehudayoff (CoRR, 2025)

Better Neural Network Expressivity: Subdividing the Simplex. - Egor Bakaev; Florestan Brunck; Christoph Hertrich; Jack Stade; Amir Yehudayoff (CoRR, 2025)

Approximation Depth of Convex Polytopes. - Egor Bakaev; Florestan Brunck; Amir Yehudayoff (CoRR, 2025)