Zvi Galil
About
In The Last Decade
Zvi Galil
186 papers receiving 5.0k citations
Peers
Comparison fields: 5 of 110
- Computational Theory and Mathematics 2.8k
- Artificial Intelligence 2.7k
- Computer Networks and Communications 1.6k
- Molecular Biology 816
- Hardware and Architecture 800
Countries citing papers authored by Zvi Galil
This map shows the geographic impact of Zvi Galil'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 Zvi Galil with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Zvi Galil more than expected).
Fields of papers citing papers by Zvi Galil
This network shows the impact of papers produced by Zvi Galil. 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 Zvi Galil. The network helps show where Zvi Galil may publish in the future.
Co-authorship network of co-authors of Zvi Galil
This figure shows the co-authorship network connecting the top 25 collaborators of Zvi Galil. A scholar is included among the top collaborators of Zvi Galil 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 Zvi Galil. Zvi Galil is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | Short length versions of Menger's theorem (Extended Abstract). | 2 |
| 3 | Proceedings of the 30th IEEE symposium on Foundations of computer science | 352 |
| 4 | 45 | |
| 5 | 2 | |
| 6 | Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching | 4 |
| 7 | Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract) | 15 |
| 8 | Maintaining biconnected components of dynamic planar graphs (extended abstract) | 7 |
| 9 | 71 | |
| 10 | 88 | |
| 11 | 8 | |
| 12 | 18 | |
| 13 | Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model | 30 |
| 14 | 11 | |
| 15 | Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract) | 1 |
| 16 | 37 | |
| 17 | 9 | |
| 18 | 14 | |
| 19 | 56 | |
| 20 | On Enumeration Procedures for Theorem Proving and for Integer Programming. | 4 |
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.