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.
Simple, deterministic, constant-round coloring in congested clique and MPC.SIAM J
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.