Polylogarithmic-time deterministic network decomposition and distributed derandomization
V Rozhoň, M Ghaffari - Proceedings of the 52nd Annual ACM SIGACT …, 2020 - dl.acm.org
We present a simple polylogarithmic-time deterministic distributed algorithm for network
decomposition. This improves on a celebrated 2 O (√ log n)-time algorithm of Panconesi …
decomposition. This improves on a celebrated 2 O (√ log n)-time algorithm of Panconesi …
An exponential separation between randomized and deterministic complexity in the LOCAL model
Over the past 30 years numerous algorithms have been designed for symmetry breaking
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …
problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge …
On derandomizing local distributed algorithms
The gap between the known randomized and deterministic local distributed algorithms
underlies arguably the most fundamental and central open question in distributed graph …
underlies arguably the most fundamental and central open question in distributed graph …
On the complexity of local distributed graph problems
This paper is centered on the complexity of graph problems in the well-studied LOCAL
model of distributed computing, introduced by Linial [FOCS'87]. It is widely known that for …
model of distributed computing, introduced by Linial [FOCS'87]. It is widely known that for …
A time hierarchy theorem for the LOCAL model
The celebrated time hierarchy theorem for Turing machines states, informally, that more
problems can be solved given more time. The extent to which a time hierarchy--type theorem …
problems can be solved given more time. The extent to which a time hierarchy--type theorem …
Sublogarithmic distributed algorithms for Lov\'asz local lemma, and the complexity hierarchy
M Fischer, M Ghaffari - arXiv preprint arXiv:1705.04840, 2017 - arxiv.org
Locally Checkable Labeling (LCL) problems include essentially all the classic problems of
$\mathsf {LOCAL} $ distributed algorithms. In a recent enlightening revelation, Chang and …
$\mathsf {LOCAL} $ distributed algorithms. In a recent enlightening revelation, Chang and …
Locally-Iterative Distributed (Δ+ 1) -Coloring below Szegedy-Vishwanathan Barrier, and Applications to Self-Stabilization and to Restricted-Bandwidth Models
L Barenboim, M Elkin, U Goldenberg - … of the 2018 ACM Symposium on …, 2018 - dl.acm.org
We consider graph coloring and related problems in the distributed message-passing
model.\em Locally-iterative algorithms are especially important in this setting. These are …
model.\em Locally-iterative algorithms are especially important in this setting. These are …
An automatic speedup theorem for distributed problems
S Brandt - Proceedings of the 2019 ACM Symposium on …, 2019 - dl.acm.org
Recently, Brandt et al. STOC'16provedalowerboundforthedistributedLov…,whichhasbeenconjecturedtobetightforsuffici…
'17.Attheheartoftheirresultliesaspeeduptechniq…,forgraphsofgirthatleast2t+2,transformsanyt …
'17.Attheheartoftheirresultliesaspeeduptechniq…,forgraphsofgirthatleast2t+2,transformsanyt …
Classification of distributed binary labeling problems
We present a complete classification of the deterministic distributed time complexity for a
family of graph problems: binary labeling problems in trees. These are locally checkable …
family of graph problems: binary labeling problems in trees. These are locally checkable …
Deterministic distributed edge-coloring via hypergraph maximal matching
We present a deterministic distributed algorithm that computes a (2Δ-1)-edge-coloring, or
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …
even list-edge-coloring, in any n-node graph with maximum degree Δ, in O (log 8 Δ· log n) …