The distributed complexity of locally checkable problems on paths is decidable

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, Volume abs/1811.01672, 2019.

Cited by: 6|Bibtex|Views36|DOI:https://doi.org/10.1145/3293611.3331606
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|dl.acm.org|arxiv.org

Abstract:

Consider a computer network that consists of a path with n nodes. The nodes are labeled with inputs from a constant-sized set, and the task is to find output labels from a constant-sized set subject to some local constraints---more formally, we have an LCL (locally checkable labeling) problem. How many communication rounds are needed (in ...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments