• DOI:10.1145/3382734.3405715
Corpus ID: 67749974

How much does randomness help with locally checkable problems?

@article{Balliu2020HowMD,
  title={How much does randomness help with locally checkable problems?},
  author={Alkida Balliu and S. Brandt and Dennis Olivetti and Jukka Suomela},
  journal={Proceedings of the 39th Symposium on Principles of Distributed Computing},
  year={2020}
}

Alkida Balliu, S. Brandt, +1 author Jukka Suomela

Published 2020

Computer Science

Proceedings of the 39th Symposium on Principles of Distributed Computing

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 randomness---for example, any deterministic distributed algorithm that finds a sinkless orientation requires Θ(log n) rounds in the LOCAL model, while the… CONTINUE READING

View on ACM

arxiv.org

Save to Library

Create Alert

Cite

Launch Research Feed