Ran Gelles

most citedThe Task Completion Problem and its Application to Crash-Resilient Computation

1 citations · 1 across the 1 of their papers we have counts for

collaborators

Showing cs.DCShow all

2 papers · 1 filter

cs.DC2026★ 1 cited

The Task Completion Problem and its Application to Crash-Resilient Computation

Orr Fischer, Ran Gelles

We study the Task Completion problem, in which $M$ abstract tasks must be completed by a network of $n$ crash-prone nodes, where up to $I^\pm n$ nodes may crash for some constant $Î±<1…

cs.DC2024

Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary

We address the problem of Reliable Broadcast in asynchronous message-passing systems with $n$ nodes, of which up to $t$ are malicious (faulty), in addition to a message adversary t…