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

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Orr Fischer, Ran Gelles
DOI: 10.48550/arxiv.2605.17961
Cited by: 1

Abstract

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 $α

Fields of Study & Subjects

Complexity and Algorithms in Graphs Distributed systems and fault tolerance Cryptography and Data Security

Publication details

Journal / source
arXiv (Cornell University)
Publication date
18 May 2026
Document type
Preprint