Brief Announcement : Distributed Derandomization Revisited

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
Date
2023-10
Major/Subject
Mcode
Degree programme
Language
en
Pages
5
1-5
Series
37th International Symposium on Distributed Computing (DISC 2023), Leibniz International Proceedings in Informatics (LIPIcs), Volume 281
Abstract
One of the cornerstones of the distributed complexity theory is the derandomization result by Chang, Kopelowitz, and Pettie [FOCS 2016]: any randomized LOCAL algorithm that solves a locally checkable labeling problem (LCL) can be derandomized with at most exponential overhead. The original proof assumes that the number of random bits is bounded by some function of the input size. We give a new, simple proof that does not make any such assumptions - it holds even if the randomized algorithm uses infinitely many bits. While at it, we also broaden the scope of the result so that it is directly applicable far beyond LCL problems.
Description
Keywords
Other note
Citation
Dahal , S , d'Amore , F , Lievonen , H , Picavet , T & Suomela , J 2023 , Brief Announcement : Distributed Derandomization Revisited . in R Oshman (ed.) , 37th International Symposium on Distributed Computing (DISC 2023) . , 40 , Leibniz International Proceedings in Informatics (LIPIcs) , vol. 281 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , pp. 1-5 , International Symposium on Distributed Computing , L'Aquila , Italy , 10/10/2023 . https://doi.org/10.4230/LIPIcs.DISC.2023.40