Follow
Amir Yehudayoff
Amir Yehudayoff
DIKU, University of Copenhagen, and Department of Mathematics, Technion
Verified email at technion.ac.il - Homepage
Title
Cited by
Cited by
Year
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
5182010
Communication Complexity: and Applications
A Rao, A Yehudayoff
Cambridge University Press, 2020
1802020
Lower bounds and separations for constant depth multilinear circuits
R Raz, A Yehudayoff
Computational Complexity 18, 171-207, 2009
1462009
Learnability can be undecidable
S Ben-David, P Hrubeš, S Moran, A Shpilka, A Yehudayoff
Nature Machine Intelligence 1 (1), 44-48, 2019
1302019
Learners that use little information
R Bassily, S Moran, I Nachum, J Shafer, A Yehudayoff
Algorithmic Learning Theory, 25-55, 2018
1152018
Sample compression schemes for VC classes
S Moran, A Yehudayoff
Journal of the ACM (JACM) 63 (3), 1-10, 2016
1072016
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
1052008
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
972013
Pseudorandom generators for regular branching programs
M Braverman, A Rao, R Raz, A Yehudayoff
SIAM Journal on Computing 43 (3), 973-986, 2014
952014
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
732008
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
692011
Balancing syntactically multilinear arithmetic circuits
R Raz, A Yehudayoff
Computational Complexity 17, 515-535, 2008
682008
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
662021
Affine extractors over prime fields
A Yehudayoff
Combinatorica 31 (2), 245-256, 2011
652011
Sign rank versus VC dimension
N Alon, S Moran, A Yehudayoff
Conference on Learning Theory, 47-80, 2016
62*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
602011
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
562010
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
532012
Supervised learning through the lens of compression
O David, S Moran, A Yehudayoff
Advances in Neural Information Processing Systems 29, 2016
522016
A characterization of multiclass learnability
N Brukhim, D Carmon, I Dinur, S Moran, A Yehudayoff
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
512022
The system can't perform the operation now. Try again later.
Articles 1–20