Eylon Yogev

782 total citations
23 papers, 139 citations indexed

About

Eylon Yogev is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Eylon Yogev has authored 23 papers receiving a total of 139 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 5 papers in Computer Networks and Communications. Recurrent topics in Eylon Yogev's work include Complexity and Algorithms in Graphs (15 papers), Cryptography and Data Security (11 papers) and Advanced Graph Theory Research (5 papers). Eylon Yogev is often cited by papers focused on Complexity and Algorithms in Graphs (15 papers), Cryptography and Data Security (11 papers) and Advanced Graph Theory Research (5 papers). Eylon Yogev collaborates with scholars based in Israel, United States and Switzerland. Eylon Yogev's co-authors include Moni Naor, Ilan Komargodski, David P. Woodruff, Merav Parter, Eyal Ronen, Alon Rosen, Tal Moran, Andreas Hülsing, Rafael Pass and Shay Moran and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and ACM SIGMOD Record.

In The Last Decade

Eylon Yogev

22 papers receiving 128 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Eylon Yogev Israel 8 102 47 31 26 21 23 139
Daniil Ryabko France 8 86 0.8× 44 0.9× 11 0.4× 31 1.2× 5 0.2× 31 137
Iftach Haitner Israel 7 149 1.5× 73 1.6× 35 1.1× 14 0.5× 25 1.2× 34 169
Wil Michiels Netherlands 6 55 0.5× 21 0.4× 26 0.8× 27 1.0× 12 0.6× 17 104
Ingo Thon Belgium 7 141 1.4× 17 0.4× 20 0.6× 16 0.6× 13 0.6× 15 162
Jakob Pagter Denmark 6 102 1.0× 40 0.9× 25 0.8× 10 0.4× 37 1.8× 9 134
Markus N. Rabe United States 6 100 1.0× 62 1.3× 22 0.7× 6 0.2× 27 1.3× 18 151
Ilan Komargodski Israel 8 124 1.2× 83 1.8× 9 0.3× 30 1.2× 21 1.0× 28 157
Peter Schachte Australia 8 98 1.0× 54 1.1× 62 2.0× 7 0.3× 42 2.0× 28 156
Michel de Rougemont France 6 89 0.9× 65 1.4× 42 1.4× 6 0.2× 11 0.5× 28 134
Parinya Chalermsook Germany 7 20 0.2× 70 1.5× 53 1.7× 13 0.5× 7 0.3× 22 128

Countries citing papers authored by Eylon Yogev

Since Specialization
Citations

This map shows the geographic impact of Eylon Yogev'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 Eylon Yogev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eylon Yogev more than expected).

Fields of papers citing papers by Eylon Yogev

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eylon Yogev. 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 Eylon Yogev. The network helps show where Eylon Yogev may publish in the future.

Co-authorship network of co-authors of Eylon Yogev

This figure shows the co-authorship network connecting the top 25 collaborators of Eylon Yogev. A scholar is included among the top collaborators of Eylon Yogev based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eylon Yogev. Eylon Yogev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Alon, Noga, et al.. (2023). Adversarial Laws of Large Numbers and Optimal Regret in Online Classification. SIAM Journal on Computing. STOC21–154. 1 indexed citations
2.
Chen, Lijie, et al.. (2023). On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. Journal of the ACM. 70(4). 1–62. 1 indexed citations
3.
Woodruff, David P., et al.. (2022). A Framework for Adversarially Robust Streaming Algorithms. Journal of the ACM. 69(2). 1–33. 9 indexed citations
4.
Alon, Noga, et al.. (2021). Adversarial laws of large numbers and optimal regret in online classification. 447–455. 10 indexed citations
5.
Woodruff, David P., et al.. (2021). A Framework for Adversarially Robust Streaming Algorithms. ACM SIGMOD Record. 50(1). 6–13. 3 indexed citations
6.
Yogev, Eylon, et al.. (2020). Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. SIAM Journal on Computing. 49(6). 1128–1172. 5 indexed citations
7.
Woodruff, David P., et al.. (2020). A Framework for Adversarially Robust Streaming Algorithms. 63–80. 11 indexed citations
8.
9.
Parter, Merav & Eylon Yogev. (2019). Low congestion cycle covers and their applications. arXiv (Cornell University). 1673–1692. 2 indexed citations
10.
Parter, Merav & Eylon Yogev. (2019). Distributed algorithms made secure: a graph theoretic approach. Symposium on Discrete Algorithms. 1693–1710. 2 indexed citations
11.
Parter, Merav & Eylon Yogev. (2019). Secure Distributed Computing Made (Nearly) Optimal. 107–116. 2 indexed citations
12.
Komargodski, Ilan, Moni Naor, & Eylon Yogev. (2019). White-Box vs. Black-Box Complexity of Search Problems. Journal of the ACM. 66(5). 1–28. 14 indexed citations
13.
Parter, Merav & Eylon Yogev. (2019). Optimal Short Cycle Decomposition in Almost Linear Time. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations
14.
Naor, Moni, et al.. (2017). The Journey from NP to TFNP Hardness. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 23. 199. 1 indexed citations
15.
Komargodski, Ilan, Gil Segev, & Eylon Yogev. (2017). Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. Journal of Cryptology. 31(1). 60–100. 5 indexed citations
16.
Yogev, Eylon, et al.. (2017). Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds. 1352–1371. 9 indexed citations
17.
Komargodski, Ilan, Moni Naor, & Eylon Yogev. (2017). White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. 24. 622–632. 2 indexed citations
18.
Komargodski, Ilan, Moni Naor, & Eylon Yogev. (2016). Secret-Sharing for NP. Journal of Cryptology. 30(2). 444–469. 20 indexed citations
19.
Naor, Moni & Eylon Yogev. (2015). Tight Bounds for Sliding Bloom Filters. Algorithmica. 73(4). 652–672. 7 indexed citations
20.
Komargodski, Ilan, Tal Moran, Moni Naor, et al.. (2014). One-Way Functions and (Im)Perfect Obfuscation. 374–383. 14 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Daniil Ryabko Breakdown of academic impact, for papers by Iftach Haitner Breakdown of academic impact, for papers by Wil Michiels Breakdown of academic impact, for papers by Ingo Thon Breakdown of academic impact, for papers by Jakob Pagter Breakdown of academic impact, for papers by Markus N. Rabe Breakdown of academic impact, for papers by Ilan Komargodski Breakdown of academic impact, for papers by Peter Schachte Breakdown of academic impact, for papers by Michel de Rougemont Breakdown of academic impact, for papers by Parinya Chalermsook
Rankless by CCL
2026