# Almost Global Problems in the LOCAL Model

@inproceedings{Balliu2018AlmostGP,
title={Almost Global Problems in the LOCAL Model},
author={Alkida Balliu and S. Brandt and Dennis Olivetti and Jukka Suomela},
booktitle={DISC},
year={2018}
}
• Alkida Balliu, +1 author Jukka Suomela
• Published in DISC 2018
• Computer Science, Mathematics
• 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)$ or $\Theta(\log n)$. - It is not possible to have a problem with complexity between $\omega(\log^* n)$ and $o(\log n)$. - In general graphs, we can construct… CONTINUE READING
17 Citations

#### References

SHOWING 1-10 OF 30 REFERENCES
A Time Hierarchy Theorem for the LOCAL Model
• Computer Science, Mathematics
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
• 31
• PDF
The Complexity of Distributed Edge Coloring with Small Palettes
• Computer Science, Mathematics
• SODA
• 2018
• 31
• PDF
Locality in Distributed Graph Algorithms
• N. Linial
• Mathematics, Computer Science
• SIAM J. Comput.
• 1992
• 806
• PDF
Distributed (δ+1)-coloring in linear (in δ) time
• Mathematics, Computer Science
• STOC '09
• 2009
• 127
• PDF
LCL Problems on Grids
• 20
• PDF
Locally Checkable Proofs in Distributed Computing
• Mathematics, Computer Science
• Theory Comput.
• 2016
• 51
• PDF