Elad Verbin

794 total citations
25 papers, 309 citations indexed

About

Elad Verbin is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Artificial Intelligence. According to data from OpenAlex, Elad Verbin has authored 25 papers receiving a total of 309 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 12 papers in Computational Theory and Mathematics and 10 papers in Artificial Intelligence. Recurrent topics in Elad Verbin's work include Complexity and Algorithms in Graphs (9 papers), Algorithms and Data Compression (5 papers) and Optimization and Search Problems (4 papers). Elad Verbin is often cited by papers focused on Complexity and Algorithms in Graphs (9 papers), Algorithms and Data Compression (5 papers) and Optimization and Search Problems (4 papers). Elad Verbin collaborates with scholars based in Israel, China and United States. Elad Verbin's co-authors include Haim Kaplan, Micha Sharir, Joshua Brody, Qin Zhang, Tova Milo, Christian Sommer, Wei Yu, Wei Yu, Jeff M. Phillips and Yongxi Cheng and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Elad Verbin

25 papers receiving 284 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Elad Verbin Israel 12 165 130 127 42 32 25 309
Kristian de Lichtenberg Denmark 5 171 1.0× 95 0.7× 133 1.0× 45 1.1× 49 1.5× 6 306
Loukas Georgiadis Greece 10 128 0.8× 65 0.5× 132 1.0× 21 0.5× 22 0.7× 32 237
Naomi Nishimura Canada 12 300 1.8× 79 0.6× 180 1.4× 45 1.1× 16 0.5× 34 385
Oded Margalit Israel 10 218 1.3× 109 0.8× 184 1.4× 46 1.1× 41 1.3× 20 372
Chu Min Li France 10 246 1.5× 270 2.1× 250 2.0× 41 1.0× 30 0.9× 21 479
Shay Mozes Israel 10 156 0.9× 214 1.6× 113 0.9× 43 1.0× 57 1.8× 35 416
Peter Emde Boas Netherlands 2 117 0.7× 179 1.4× 125 1.0× 51 1.2× 62 1.9× 2 325
Michal Parnas Israel 13 264 1.6× 238 1.8× 104 0.8× 43 1.0× 41 1.3× 27 411
Surender Baswana India 14 388 2.4× 155 1.2× 252 2.0× 80 1.9× 48 1.5× 37 504
Pascal Schweitzer Germany 11 207 1.3× 86 0.7× 140 1.1× 40 1.0× 35 1.1× 38 415

Countries citing papers authored by Elad Verbin

Since Specialization
Citations

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

Fields of papers citing papers by Elad Verbin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Elad Verbin

This figure shows the co-authorship network connecting the top 25 collaborators of Elad Verbin. A scholar is included among the top collaborators of Elad Verbin 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 Elad Verbin. Elad Verbin 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.
Bogdanov, Andrej, Zeev Dvir, Elad Verbin, & Amir Yehudayoff. (2013). . Theory of Computing. 9(1). 283–293. 12 indexed citations
2.
Verbin, Elad & Qin Zhang. (2013). The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model. SIAM Journal on Computing. 42(1). 212–229. 6 indexed citations
3.
Phillips, Jeff M., Elad Verbin, & Qin Zhang. (2012). Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy. 486–501. 17 indexed citations
4.
Daskalakis, Constantinos, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, & Elad Verbin. (2011). Sorting and Selection in Posets. SIAM Journal on Computing. 40(3). 597–622. 17 indexed citations
5.
6.
Verbin, Elad & Qin Zhang. (2010). The limits of buffering. 447–456. 7 indexed citations
7.
Cheng, Yongxi, et al.. (2010). Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem. SIAM Journal on Discrete Mathematics. 24(4). 1322–1335. 22 indexed citations
8.
Bogdanov, Andrej, Zeev Dvir, Elad Verbin, & Amir Yehudayoff. (2009). Pseudorandomness for Width 2 Branching Programs.. Electronic colloquium on computational complexity. 16. 70. 4 indexed citations
9.
Daskalakis, Constantinos, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, & Elad Verbin. (2009). Sorting and selection in posets. Symposium on Discrete Algorithms. 392–401. 10 indexed citations
10.
Milo, Tova, et al.. (2009). Querying DAG-shaped Execution Traces Through Views. 1 indexed citations
11.
Daskalakis, Constantinos, Richard M. Karp, Elchanan Mossel, Samantha J. Riesenfeld, & Elad Verbin. (2009). Sorting and Selection in Posets. 392–401. 2 indexed citations
12.
Milo, Tova, et al.. (2009). Optimized union of non-disjoint distributed data sets. 12–23. 2 indexed citations
13.
Yao, Hongyi & Elad Verbin. (2009). Network coding is highly non-approximable. 1. 209–213. 7 indexed citations
14.
Kalai, Adam Tauman, Yishay Mansour, & Elad Verbin. (2008). On agnostic boosting and parity learning. 629–638. 14 indexed citations
15.
Kaplan, Haim, et al.. (2008). Efficient Colored Orthogonal Range Counting. SIAM Journal on Computing. 38(3). 982–1011. 25 indexed citations
16.
Kaplan, Haim, et al.. (2007). Counting colors in boxes. Symposium on Discrete Algorithms. 785–794. 13 indexed citations
17.
Kaplan, Haim, et al.. (2007). A simpler analysis of Burrows–Wheeler-based compression. Theoretical Computer Science. 387(3). 220–235. 10 indexed citations
18.
Kaplan, Haim, et al.. (2006). A simpler analysis of Burrows-Wheeler based compression. 1 indexed citations
19.
Kaplan, Haim, Micha Sharir, & Elad Verbin. (2006). Colored intersection searching via sparse rectangular matrix multiplication. 52–60. 24 indexed citations
20.
Kaplan, Haim & Elad Verbin. (2005). Sorting signed permutations by reversals, revisited. Journal of Computer and System Sciences. 70(3). 321–341. 10 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 Kristian de Lichtenberg Breakdown of academic impact, for papers by Loukas Georgiadis Breakdown of academic impact, for papers by Naomi Nishimura Breakdown of academic impact, for papers by Oded Margalit Breakdown of academic impact, for papers by Chu Min Li Breakdown of academic impact, for papers by Shay Mozes Breakdown of academic impact, for papers by Peter Emde Boas Breakdown of academic impact, for papers by Michal Parnas Breakdown of academic impact, for papers by Surender Baswana Breakdown of academic impact, for papers by Pascal Schweitzer
Rankless by CCL
2026