Almost Global Problems in the LOCAL Model

  title={Almost Global Problems in the LOCAL Model},
  author={Alkida Balliu and S. Brandt and Dennis Olivetti and Jukka Suomela},
  • Alkida Balliu, S. Brandt, +1 author Jukka Suomela
  • Published in DISC 2018
  • Computer Science
  • 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

    Figures and Topics from this paper.

    Explore Further: Topics Discussed in This Paper

    Almost global problems in the LOCAL model
    The Complexity Landscape of Distributed Locally Checkable Problems on Trees
    Locality of not-so-weak coloring
    • 6
    • PDF
    A Breezing Proof of the KMW Bound
    Parameterized Distributed Complexity Theory: A logical approach
    Classification of distributed binary labeling problems
    • 8
    • PDF


    A Time Hierarchy Theorem for the LOCAL Model
    • Yi-Jun Chang, Seth Pettie
    • Mathematics, Computer Science
    • 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
    • 2017
    • 28
    • PDF
    Locality in Distributed Graph Algorithms
    • N. Linial
    • Mathematics, Computer Science
    • SIAM J. Comput.
    • 1992
    • 798
    • PDF
    Distributed (δ+1)-coloring in linear (in δ) time
    • 129
    • PDF
    LCL Problems on Grids
    • 19
    • PDF
    Distributed ( ∆ + 1 )-Coloring in Linear ( in ∆ ) Time
    • Nico Eigenmann
    • 2009
    • 86
    • PDF
    What Can Be Computed Locally ?
    • 175
    • PDF
    Locally Checkable Proofs in Distributed Computing
    • 48
    • PDF