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.
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
PPT (Upload PPT)