8 citations · 21 across the 13 of their papers we have counts for
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 abstract tasks must be completed by a network of crash-prone nodes, where up to nodes may crash for some constant .…
cs.DC2015★ 8 cited
A Lower Bound for the Distributed Lovász Local Lemma
Sebastian Brandt, Orr Fischer, Juho Hirvonen +5
We show that any randomised Monte Carlo distributed algorithm for the Lovász local lemma requires communication rounds, assuming that it finds a correct assignment…