How much does randomness help with locally checkable problems?
PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020, pp. 299-308, 2019.
Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from r...More
PPT (Upload PPT)