17 citations · 29 across the 16 of their papers we have counts for
20 papers
Time is not a Healer, but it Sure Makes Hindsight 20:20
Eli Gafni, Giuliano Losa
In the 1980s, three related impossibility results emerged in the field of distributed computing. First, Fischer, Lynch, and Paterson demonstrated that deterministic consensus is un…
Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory
Eli Gafni, Vasileios Zikas
Like Asynchrony, Mobility of faults precludes consensus. Yet, a model M in which Consensus is solvable, has an analogue relaxed model in which Consensus is not solvable and for whi…
Consensus in the Unknown-Participation Message-Adversary Model
Giuliano Losa, Eli Gafni
We propose a new distributed-computing model, inspired by permissionless distributed systems such as Bitcoin and Ethereum, that allows studying permissionless consensus in a mathem…
A King in every two consecutive tournaments
Yehuda Afek, Eli Gafni, Nati Linial
We think of a tournament as a communication network where in each round of communication processor sends its information to , for every directed edge $ij \i…
The Life in 1-Consensus
Yehuda Afek, Eli Daian, Eli Gafni
This paper introduces the atomic Write and Read Next () deterministic shared memory object, that for any , is stronger than read-write registers, but is unab…
An Algorithmic Approach to the Asynchronous Computability Theorem
Vikram Saraph, Maurice Herlihy, Eli Gafni
The asynchronous computability theorem (ACT) uses concepts from combinatorial topology to characterize which tasks have wait-free solutions in read-write memory. A task can be expr…