Almost global problems in the LOCAL model

Distributed Computing, 2020.

Cited by: 14|Bibtex|Views43|DOI:https://doi.org/10.1007/s00446-020-00375-2
Other Links: academic.microsoft.com|arxiv.org

Abstract:

The landscape of the distributed time complexity is nowadays well-understood for subpolynomial complexities. When we look at deterministic algorithms in the LOCAL model and locally checkable problems (LCLs) in bounded-degree graphs, the following picture emerges: - There are lots of problems with time complexities of $\Theta(\log^* n)...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments