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} }
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
Supplemental Presentations
Figures and Topics from this paper
17 Citations
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
- Mathematics, Computer Science
- DISC
- 2020
- Highly Influenced
- PDF
The Distributed Complexity of Locally Checkable Problems on Paths is Decidable
- Computer Science
- PODC
- 2019
- 8
- PDF
Parameterized Distributed Complexity Theory: A logical approach
- Computer Science
- ArXiv
- 2019
- Highly Influenced
- PDF
References
SHOWING 1-10 OF 30 REFERENCES
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
- Mathematics, Computer Science
- SIAM J. Comput.
- 2019
- 86
- PDF
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
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma
- Mathematics, Computer Science
- ACM Trans. Algorithms
- 2020
- 4
Locally Checkable Proofs in Distributed Computing
- Mathematics, Computer Science
- Theory Comput.
- 2016
- 51
- PDF