Ittai Abraham

7.0k total citations · 1 hit paper
90 papers, 2.5k citations indexed

About

Ittai Abraham is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Ittai Abraham has authored 90 papers receiving a total of 2.5k indexed citations (citations by other indexed papers that have themselves been cited), including 62 papers in Computer Networks and Communications, 27 papers in Artificial Intelligence and 26 papers in Computational Theory and Mathematics. Recurrent topics in Ittai Abraham's work include Distributed systems and fault tolerance (34 papers), Cryptography and Data Security (22 papers) and Complexity and Algorithms in Graphs (20 papers). Ittai Abraham is often cited by papers focused on Distributed systems and fault tolerance (34 papers), Cryptography and Data Security (22 papers) and Complexity and Algorithms in Graphs (20 papers). Ittai Abraham collaborates with scholars based in Israel, United States and United Kingdom. Ittai Abraham's co-authors include Dahlia Malkhi, Maofan Yin, Guy Golan Gueta, Michael K. Reiter, Danny Dolev, Ofer Neiman, Yair Bartal, Vijay Chidambaram, Kartik Nayak and Ling Ren and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Computer Networks.

In The Last Decade

Ittai Abraham

87 papers receiving 2.4k citations

Hit Papers

HotStuff 2019 2026 2021 2023 2019 100 200 300 400

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ittai Abraham Israel 28 1.7k 886 632 402 183 90 2.5k
Tom Leighton United States 22 2.9k 1.7× 505 0.6× 557 0.9× 893 2.2× 126 0.7× 81 3.8k
Amit Kumar India 26 1.4k 0.8× 199 0.2× 435 0.7× 532 1.3× 267 1.5× 119 2.3k
Dahlia Malkhi United States 36 3.8k 2.2× 1.3k 1.5× 1.2k 1.9× 377 0.9× 140 0.8× 138 4.6k
Rina Panigrahy‎ United States 29 3.0k 1.8× 1.2k 1.4× 1.5k 2.4× 422 1.0× 540 3.0× 74 4.5k
R.J. Lipton United States 19 562 0.3× 878 1.0× 664 1.1× 441 1.1× 387 2.1× 50 2.5k
Sampath Kannan United States 23 540 0.3× 223 0.3× 961 1.5× 745 1.9× 206 1.1× 67 1.8k
Sandy Irani United States 26 1.7k 1.0× 321 0.4× 337 0.5× 261 0.6× 50 0.3× 59 2.5k
A. W. Roscoe United Kingdom 26 1.0k 0.6× 892 1.0× 1.9k 3.1× 1.9k 4.8× 208 1.1× 103 3.7k
Raffaele Perego Italy 26 498 0.3× 1.2k 1.4× 1.1k 1.8× 399 1.0× 539 2.9× 176 2.5k
Seif Haridi Sweden 24 2.1k 1.3× 846 1.0× 847 1.3× 219 0.5× 302 1.7× 146 2.8k

Countries citing papers authored by Ittai Abraham

Since Specialization
Citations

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

Fields of papers citing papers by Ittai Abraham

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Ittai Abraham

This figure shows the co-authorship network connecting the top 25 collaborators of Ittai Abraham. A scholar is included among the top collaborators of Ittai Abraham 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 Ittai Abraham. Ittai Abraham 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.
Abraham, Ittai, et al.. (2024). Autobahn: Seamless high speed BFT. 1–23. 3 indexed citations
2.
Howard, Heidi, et al.. (2023). BeeGees: Stayin' Alive in Chained BFT. 233–243. 17 indexed citations
3.
Abraham, Ittai, T-H. Hubert Chan, Danny Dolev, et al.. (2022). Communication complexity of byzantine agreement, revisited. Distributed Computing. 36(1). 3–28. 6 indexed citations
4.
Abraham, Ittai, et al.. (2021). Brief Announcement: Communication-Efficient BFT Using Small Trusted Hardware to Tolerate Minority Corruption.. 1 indexed citations
5.
Abraham, Ittai, Kartik Nayak, Ling Ren, & Zhuolun Xiang. (2020). Optimal good-case latency for byzantine broadcast and state machine replication. arXiv (Cornell University). 2 indexed citations
6.
Abraham, Ittai, Kartik Nayak, Ling Ren, & Zhuolun Xiang. (2020). Brief Announcement: Byzantine Agreement, Broadcast and State Machine Replication with Optimal Good-Case Latency. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3. 1 indexed citations
7.
Abraham, Ittai, Susan Athey, Moshe Babaioff, & Michael D. Grubb. (2020). Peaches, lemons, and cookies: Designing auction markets with dispersed information. Games and Economic Behavior. 124. 454–477. 9 indexed citations
8.
Abraham, Ittai & Ofer Neiman. (2019). Using Petal-Decompositions to Build a Low Stretch Spanning Tree. SIAM Journal on Computing. 48(2). 227–248. 9 indexed citations
9.
Golan-Gueta, Guy, Ittai Abraham, Dahlia Malkhi, et al.. (2018). SBFT: a Scalable Decentralized Trust Infrastructure for Blockchains.. arXiv (Cornell University). 34 indexed citations
10.
Abraham, Ittai, Guy Golan Gueta, & Dahlia Malkhi. (2018). Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil.. arXiv (Cornell University). 11 indexed citations
11.
Abraham, Ittai & Dahlia Malkhi. (2017). The Blockchain Consensus Layer and BFT. Bulletin of the European Association for Theoretical Computer Science. 3(123). 32 indexed citations
12.
Abraham, Ittai, Dahlia Malkhi, Kartik Nayak, Ling Ren, & Alexander Spiegelman. (2016). Solidus: An Incentive-compatible Cryptocurrency Based on Permissionless Byzantine Consensus.. arXiv (Cornell University). 40 indexed citations
13.
Abraham, Ittai, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, & Renato F. Werneck. (2015). On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs. 740–753.
14.
Abraham, Ittai, Shiri Chechik, David Kempe, & Aleksandrs Slivkins. (2013). Low-distortion inference of latent similarities from a multiplex social network. Symposium on Discrete Algorithms. 1853–1883. 12 indexed citations
15.
Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2011). Advances in metric embedding theory. Advances in Mathematics. 228(6). 3026–3126. 32 indexed citations
16.
Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2009). On low dimensional local embeddings. Symposium on Discrete Algorithms. 875–884. 6 indexed citations
17.
Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2007). Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. Symposium on Discrete Algorithms. 502–511. 22 indexed citations
18.
Abraham, Ittai, Yair Bartal, & Ofer Neiman. (2007). Embedding metric spaces in their intrinsic dimension. CaltechAUTHORS (California Institute of Technology). 17 indexed citations
19.
Abraham, Ittai, et al.. (2004). LAND: stretch (1 + ε) locality-aware networks for DHTs. Symposium on Discrete Algorithms. 550–559. 29 indexed citations
20.
Abraham, Ittai, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, & Mikkel Thorup. (2004). Compact Name-Independent Routing with Minimum Stretch. HAL (Le Centre pour la Communication Scientifique Directe). 1 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

Rankless by CCL
2026