Elad Verbin
Impact in
-
- Computational Geometry and Mesh Generation
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Optimization and Search Problems 4
- Peer-to-Peer Network Technologies 3
-
- Complexity and Algorithms in Graphs 9
- Advanced Graph Theory Research 4
- Co-authors
- Haim Kaplan (6 shared papers)Micha Sharir (3 shared papers)Qin Zhang (4 shared papers)Joshua Brody (1 shared paper)Tova Milo (4 shared papers)Wei Yu (1 shared paper)Christian Sommer (1 shared paper)Jeff M. Phillips (2 shared papers)
- Journals
- SIAM Journal on Computing (4 papers)Journal of Computer and System Sciences (2 papers)Theoretical Computer Science (1 paper)Theory of Computing (1 paper)SIAM Journal on Discrete Mathematics (1 paper)
- Partner nations
- IsraelChinaUnited States
In The Last Decade
Elad Verbin
25 papers receiving 287 citations
Peers
Comparison fields: 5 of 41
- Computer Graphics and Computer-Aided Design 43
- Computational Theory and Mathematics 166
- Computer Networks and Communications 128
- Computational Mathematics 3
- Artificial Intelligence 132
Countries citing papers authored by Elad Verbin
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
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-authors
The 21 scholars most cited alongside Elad Verbin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 25 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2010 | 29 | |
| 2 | 2007 | 28 | |
| 3 | 2009 | 27 | |
| 4 | 2008 | 26 | |
| 5 | 2006 | 24 | |
| 6 | 2010 | 22 | |
| 7 | 2012 | 18 | |
| 8 | 2011 | 17 | |
| 9 | 2008 | 14 | |
| 10 | 2011 | 14 | |
| 11 | 2007 | 13 | |
| 12 | 2013 | 12 | |
| 13 | 2009 | 10 | |
| 14 | 2005 | 10 | |
| 15 | 2007 | 10 | |
| 16 | 2009 | 7 | |
| 17 | 2010 | 7 | |
| 18 | 2013 | 6 | |
| 19 | 2016 | 6 | |
| 20 | Pseudorandomness for Width 2 Branching Programs. | 2009 | 4 |
About Elad Verbin
Elad Verbin is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Artificial Intelligence, Molecular Biology and Signal Processing, having authored 25 papers that have together received 312 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (9 papers), Algorithms and Data Compression (5 papers), Optimization and Search Problems (4 papers), Data Management and Algorithms (4 papers), Advanced Graph Theory Research (4 papers), DNA and Biological Computing (4 papers), Cryptography and Data Security (3 papers) and Peer-to-Peer Network Technologies (3 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (43 citations), Computational Theory and Mathematics (166 citations), Computer Networks and Communications (128 citations), Computational Mathematics (3 citations) and Artificial Intelligence (132 citations). Elad Verbin has collaborated with scholars based in Israel, China and United States. Frequent co-authors include Haim Kaplan, Micha Sharir, Qin Zhang, Joshua Brody, Tova Milo, Wei Yu, Christian Sommer, Jeff M. Phillips, Wei Yu and Richard M. Karp. Their work appears in journals such as SIAM Journal on Computing, Journal of Computer and System Sciences, Theoretical Computer Science, Theory of Computing and SIAM Journal on Discrete Mathematics.
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.