2026 Eli Gafni: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	45	7233	7023	3158	3038	163	7895

Overview

Eli Gafni is affiliated with the University of California, Los Angeles in the United States. Their research primarily focuses on computer science with a notable concentration in distributed systems and fault tolerance, as well as optimization and search problems.

Their work spans several subfields within computer science, including computer networks and communications, artificial intelligence, information systems, hardware and architecture, and mechanical engineering.

The main topics covered in their research are distributed systems and fault tolerance, optimization and search problems, interconnection networks and systems, cryptography and data security, blockchain technology applications and security, parallel computing and optimization techniques, and logic, programming, and type systems.

Among their recent published papers are:

Consensus in the Unknown-Participation Message-Adversary Model (2023), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
The assignment problem (2021), published in Theoretical Computer Science
Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory (2023), published on arXiv (Cornell University)
Time is not a Healer, but it Sure Makes Hindsight 20:20 (2023), published on arXiv (Cornell University)

They have collaborated frequently with several researchers including:

Giuliano Losa
Carole Delporte-Gallet
Hugues Fauconnier
Vasileios Zikas

The venues where their work has been published more than once include arXiv (Cornell University), Leibniz-Zentrum für Informatik (Schloss Dagstuhl), and Theoretical Computer Science.

Best Publications

Atomic snapshots of shared memory

Yehuda Afek;Hagit Attiya;Danny Dolev;Eli Gafni

731
Citations
Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology

E. Gafni;D. Bertsekas

529
Citations
Generalized FLP impossibility result for t-resilient asynchronous computations

Elizabeth Borowsky;Eli Gafni

521
Citations
Projection methods for variational inequalities with application to the traffic assignment problem

Dimitri P. Bertsekas;Eli M. Gafni

476
Citations
TWO-METRIC PROJECTION METHODS FOR CONSTRAINED OPTIMIZATION*

Eli M. Gafni;Dimitri P. Bertsekas

301
Citations
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony

Eli Gafni

288
Citations
Immediate atomic snapshots and fast renaming

Elizabeth Borowsky;Eli Gafni

266
Citations
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks

D. Bertsekas;E. Gafni;R. Gallager

218
Citations
Disk Paxos

Eli Gafni;Leslie Lamport

177
Citations
Applying static network protocols to dynamic networks

Yehuda Afek;Baruch Awerbuch;Eli Gafni

168
Citations
Efficient methods for integrating traceability and broadcast encryption

E. Gafni;J. Staddon;Y. L. Yin

165
Citations
The BG distributed simulation algorithm

E. Borowsky;E. Gafni;N. Lynch;S. Rajsbaum

165
Citations
Projected Newton methods and optimization of multicommodity flows

D. Bertsekas;E. Gafni

155
Citations
A simple algorithmically reasoned characterization of wait-free computation (extended abstract)

Elizabeth Borowsky;Eli Gafni

154
Citations
Concurrency in heavily loaded neighborhood-constrained systems

Susan L. Graham

146
Citations
Dynamic control of session input rates in communication networks

E. Gafni;D. Bertsekas

128
Citations
Atomic snapshots of shared memory

Yehuda Afek;Danny Dolev;Hagit Attiya;Eli Gafni

127
Citations
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).

Eli Gafni

127
Citations
Fast and secure global payments with Stellar

Marta Lokhava;Giuliano Losa;David Mazières;Graydon Hoare

119
Citations
Improvements in the time complexity of two message-optimal election algorithms

Eli Gafni

117
Citations
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony”

Eli Gafni

108
Citations

Frequent Co-Authors

Yehuda Afek Tel Aviv University

Sergio Rajsbaum National Autonomous University of Mexico

Dimitri P. Bertsekas Arizona State University

Danny Dolev Hebrew University of Jerusalem

Michel Raynal Institut de Recherche en Informatique et Systèmes Aléatoires

Maurice Herlihy Brown University

Leslie Lamport Microsoft (United States)

Nir Shavit MIT

Marcos K. Aguilera VMware

Michael Merritt AT&T (United States)

External Links

Personal website of Eli Gafni Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees offers flexibility and a wide range of career opportunities for students interested in Computer Science. Affordable education options have become more accessible, with many institutions now offering quality programs at reduced costs. For example, students looking for advanced business skills can consider the cheapest mba online programs, blending leadership and technical expertise.

Fast-track options, such as some of the online masters degree programs, allow students to complete a graduate degree in as little as 12 months, enabling quicker entry into the workforce. Additionally, those prioritizing immediate earnings and efficient study can explore short careers that pay well, with programs focusing on high-demand technical roles.

Artificial intelligence remains a high-growth area within Computer Science. Those interested can pursue specialized learning through online ai degree programs, gaining valuable skills for cutting-edge industries. With the right online degree, students can unlock diverse and lucrative career pathways, all while enjoying the convenience of remote learning.