ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19
◽
10.1145/3293611.3331606
◽
2019
◽
Cited By ~ 3
Author(s):
Alkida Balliu
◽
Sebastian Brandt
◽
Yi-Jun Chang
◽
Dennis Olivetti
◽
Mikaël Rabie
◽
...
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close