1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
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 αn nodes may crash for some constant α<1.…