How much does randomness help with locally checkable problems?

DOI10.1145/3382734.3405715OpenAlexW3046559103MaRDI QIDQ5855249

Alkida Balliu, Jukka Suomela, Dennis Olivetti, Sebastian F. Brandt

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.06803

zbMATH Keywords

LOCAL modeldistributed computational complexitylocally checkable labeling problems

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (5)

Network Decomposition and Distributed Derandomization (Invited Paper) ⋮ Locally checkable problems in rooted trees ⋮ Distributed graph problems through an automata-theoretic lens ⋮ Almost global problems in the LOCAL model ⋮ Distributed graph problems through an automata-theoretic Lens

This page was built for publication: How much does randomness help with locally checkable problems?