A deterministic algorithm solves the Task Completion problem with crashes in near-optimal rounds and yields an improved crash-resilient simulation of congested-clique algorithms.
The complexity of (∆+1) coloring in congested clique, massively parallel computation, and centralized local computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Task Completion Problem and its Application to Crash-Resilient Computation
A deterministic algorithm solves the Task Completion problem with crashes in near-optimal rounds and yields an improved crash-resilient simulation of congested-clique algorithms.