Any Las Vegas algorithm with locally certifiable failures can be converted into a zero-error Las Vegas algorithm that faithfully reproduces the correct output of the original algorithm in successful executions, with only polylogarithmic overhead in time complexity.
The core message of this paper is to provide optimal communication protocols for approximating sums of entrywise functions in the coordinator model, as well as efficient algorithms for solving linear algebra problems in more general network topologies using the personalized CONGEST model.
The author presents the MaxCUCL algorithm to achieve max-consensus deterministically in networks with unreliable communication links, enabling nodes to identify convergence and transition to subsequent tasks.