Ilan Komargodski
- Artificial Intelligence top 10%
- Computational Theory and Mathematics top 5%
- Computer Vision and Pattern Recognition
- Information Systems
- Electrical and Electronic Engineering
- Topics
- Cryptography and Data Security (21 papers)Complexity and Algorithms in Graphs (14 papers)Privacy-Preserving Technologies in Data (7 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceComputer Vision and Pattern Recognition
- Partner nations
- IsraelUnited StatesItaly
In The Last Decade
Ilan Komargodski
24 papers receiving 141 citations
Peers
Comparison fields: 5 of 26
- Artificial Intelligence 124
- Computational Theory and Mathematics 83
- Computer Vision and Pattern Recognition 30
- Information Systems 21
- Electrical and Electronic Engineering 11
Countries citing papers authored by Ilan Komargodski
This map shows the geographic impact of Ilan Komargodski'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 Ilan Komargodski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ilan Komargodski more than expected).
Fields of papers citing papers by Ilan Komargodski
This network shows the impact of papers produced by Ilan Komargodski. 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 Ilan Komargodski. The network helps show where Ilan Komargodski may publish in the future.
Co-authorship network of co-authors of Ilan Komargodski
This figure shows the co-authorship network connecting the top 25 collaborators of Ilan Komargodski. A scholar is included among the top collaborators of Ilan Komargodski 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 Ilan Komargodski. Ilan Komargodski 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 | 3 | |
| 3 | 10 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 0 | |
| 8 | 2 | |
| 9 | 2 | |
| 10 | 5 | |
| 11 | 14 | |
| 12 | 2 | |
| 13 | 5 | |
| 14 | 7 | |
| 15 | 9 | |
| 16 | 20 | |
| 17 | 20 | |
| 18 | 22 | |
| 19 | Average-Case Lower Bounds for Formula Size. | 2 |
| 20 | The Spectrum of Small DeMorgan Formulas. | 2 |
About Ilan Komargodski
Ilan Komargodski is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Information Systems, having authored 28 papers that have together received 157 indexed citations. Recurring topics across this work include Cryptography and Data Security (21 papers), Complexity and Algorithms in Graphs (14 papers) and Privacy-Preserving Technologies in Data (7 papers). The work is most often cited by research in Computational Theory and Mathematics (83 citations), Artificial Intelligence (124 citations) and Computer Vision and Pattern Recognition (30 citations). Ilan Komargodski has collaborated with scholars based in Israel, United States and Italy. Frequent co-authors include Ran Raz, Eylon Yogev, Moni Naor, Avishay Tal, Gil Segev, Zvika Brakerski, Alon Rosen, Pratish Datta, Brent Waters and Tal Moran. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Information and Computation.
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.