Amir Yehudayoff
-
- Complexity and Algorithms in Graphs 41
- Advanced Graph Theory Research 16
- Computability, Logic, AI Algorithms 12
- Computational Mathematics top 5%
- Artificial Intelligence top 5%
- Machine Learning and Algorithms 14
- Algorithms and Data Compression 12
- Quantum Computing Algorithms and Architecture 9
-
- graph theory and CDMA systems 10
-
- Markov Chains and Monte Carlo Methods 10
Amir Yehudayoff
76 papers receiving 677 citations
Peers
Comparison fields: 5 of 67
- Computational Theory and Mathematics 514
- Computational Mathematics 19
- Discrete Mathematics and Combinatorics 54
- Artificial Intelligence 410
- Algebra and Number Theory 46
Countries citing papers authored by Amir Yehudayoff
This map shows the geographic impact of Amir Yehudayoff's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Amir Yehudayoff with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amir Yehudayoff more than expected).
Fields of papers citing papers by Amir Yehudayoff
This network shows the impact of papers produced by Amir Yehudayoff. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Amir Yehudayoff. The network helps show where Amir Yehudayoff may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Amir Yehudayoff, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2024 | 2 | |
| 2 | 2023 | 1 | |
| 3 | 2023 | 5 | |
| 4 | 2020 | 2 | |
| 5 | On Communication Complexity of Classification Problems | 2017 | 1 |
| 6 | Supervised learning through the lens of compression | 2016 | 5 |
| 7 | Proper PAC learning is compressing | 2015 | 0 |
| 8 | Sign Rank, VC Dimension and Spectral Gaps | 2014 | 2 |
| 9 | Inequalities and tail bounds for elementary symmetric polynomials. | 2014 | 1 |
| 10 | Direct product via round-preserving compression. | 2013 | 3 |
| 11 | 2013 | 12 | |
| 12 | Direct Products in Communication Complexity. | 2012 | 5 |
| 13 | Formulas are exponentially stronger than monotone circuits in non-commutative setting. | 2012 | 1 |
| 14 | Linear cover time for trees is exponentially unlikely. | 2012 | 0 |
| 15 | 2012 | 6 | |
| 16 | 2011 | 7 | |
| 17 | 2011 | 9 | |
| 18 | Non-commutative circuits and the sum-of-squares problem. | 2010 | 1 |
| 19 | Relationless completeness and separations. | 2010 | 1 |
| 20 | Pseudorandomness for Width 2 Branching Programs. | 2009 | 4 |
About Amir Yehudayoff
Amir Yehudayoff is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Artificial Intelligence, having authored 88 papers that have together received 755 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (41 papers), Advanced Graph Theory Research (16 papers), Machine Learning and Algorithms (14 papers), Algorithms and Data Compression (12 papers), Computability, Logic, AI Algorithms (12 papers), graph theory and CDMA systems (10 papers), Markov Chains and Monte Carlo Methods (10 papers) and Quantum Computing Algorithms and Architecture (9 papers). The work is most often cited by research in Computational Theory and Mathematics (514 citations), Computational Mathematics (19 citations) and Discrete Mathematics and Combinatorics (54 citations). Amir Yehudayoff has collaborated with scholars based in Israel, United States and Germany. Frequent co-authors include Amir Shpilka, Ran Raz, Anup Rao, Pavel Hrubeš, Avi Wigderson, Shay Moran, Zeev Dvir, Mark Braverman, Omri Weinstein and Jean Bourgain. Their work appears in journals such as Proceedings of the National Academy of Sciences, Journal of the ACM and Machine Learning.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.