Randomized local network computing : Derandomization beyond locally checkable labelings - Archive ouverte HAL
Journal Articles ACM Transactions on Parallel Computing Year : 2021

Randomized local network computing : Derandomization beyond locally checkable labelings

Abstract

We carry on investigating the line of research questioning the power of randomization for the design of distributed algorithms. In their seminal paper, Naor and Stockmeyer [STOC 1993] established that, in the context of network computing in which all nodes execute the same algorithm in parallel, any construction task that can be solved locally by a randomized Monte-Carlo algorithm can also be solved locally by a deterministic algorithm. This result however holds only for distributed tasks such that the correctness of their solutions can be locally checked by a deterministic algorithm. In this paper, we extend the result of Naor and Stockmeyer to a wider class of tasks. Specifically, we prove that the same derandomization result holds for every task such that the correctness of their solutions can be locally checked using a 2-sided error randomized Monte-Carlo algorithm.
Fichier principal
Vignette du fichier
main-derandomize.pdf (662.25 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03610006 , version 1 (16-03-2022)

Identifiers

Cite

Laurent Feuilloley, Pierre Fraigniaud. Randomized local network computing : Derandomization beyond locally checkable labelings. ACM Transactions on Parallel Computing, 2021, 8 (4), pp.1-25. ⟨10.1145/3470640⟩. ⟨hal-03610006⟩
30 View
80 Download

Altmetric

Share

More