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 …
Lower bounds for maximal matchings and maximal independent sets
There are distributed graph algorithms for finding maximal matchings and maximal
independent sets in O (Δ+ log* n) communication rounds; here, n is the number of nodes …
independent sets in O (Δ+ log* n) communication rounds; here, n is the number of nodes …
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 …
Distributed (∆+ 1)-coloring in sublogarithmic rounds
The (∆+ 1)-coloring problem is a fundamental symmetry breaking problem in distributed
computing. We give a new randomized coloring algorithm for (∆+ 1)-coloring running in O …
computing. We give a new randomized coloring algorithm for (∆+ 1)-coloring running in O …
Distributed degree splitting, edge coloring, and orientations
M Ghaffari, HH Su - Proceedings of the Twenty-Eighth Annual ACM-SIAM …, 2017 - SIAM
We study a family of closely-related distributed graph problems, which we call degree
splitting, where roughly speaking the objective is to partition (or orient) the edges such that …
splitting, where roughly speaking the objective is to partition (or orient) the edges such that …
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 …
Conditional hardness results for massively parallel computation from distributed lower bounds
We present the first conditional hardness results for massively parallel algorithms for some
central graph problems including (approximating) maximum matching, vertex cover …
central graph problems including (approximating) maximum matching, vertex cover …
Derandomizing local distributed algorithms under bandwidth restrictions
K Censor-Hillel, M Parter, G Schwartzman - Distributed Computing, 2020 - Springer
This paper addresses the cornerstone family of local problems in distributed computing, and
investigates the curious gap between randomized and deterministic solutions under …
investigates the curious gap between randomized and deterministic solutions under …