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 …
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 …
Local problems on trees from the perspectives of distributed algorithms, finitary factors, and descriptive combinatorics
We study connections between distributed local algorithms, finitary factors of iid processes,
and descriptive combinatorics in the context of regular trees. We extend the Borel …
and descriptive combinatorics in the context of regular trees. We extend the Borel …
Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics
J Grebík, V Rozhoň - Advances in Mathematics, 2023 - Elsevier
We present an intimate connection among the following fields:(a) distributed local
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …
algorithms: coming from the area of computer science,(b) finitary factors of iid processes …
New classes of distributed time complexity
A number of recent papers–eg Brandt et al.(STOC 2016), Chang et al.(FOCS 2016), Ghaffari
& Su (SODA 2017), Brandt et al.(PODC 2017), and Chang & Pettie (FOCS 2017)–have …
& Su (SODA 2017), Brandt et al.(PODC 2017), and Chang & Pettie (FOCS 2017)–have …
Locally checkable problems in rooted trees
Consider any locally checkable labeling problem Π in rooted regular trees: there is a finite
set of labels Σ, and for each label χ x Σ we specify what are permitted label combinations of …
set of labels Σ, and for each label χ x Σ we specify what are permitted label combinations of …
The complexity landscape of distributed locally checkable problems on trees
YJ Chang - arxiv preprint arxiv:2009.09645, 2020 - arxiv.org
Recent research revealed the existence of gaps in the complexity landscape of locally
checkable labeling (LCL) problems in the LOCAL model of distributed computing. For …
checkable labeling (LCL) problems in the LOCAL model of distributed computing. For …
Locally checkable labelings with small messages
A rich line of work has been addressing the computational complexity of locally checkable
labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we study …
labelings (LCLs), illustrating the landscape of possible complexities. In this paper, we study …
Distributed edge coloring and a special case of the constructive Lovász local lemma
The complexity of distributed edge coloring depends heavily on the palette size as a function
of the maximum degree Δ. In this article, we explore the complexity of edge coloring in the …
of the maximum degree Δ. In this article, we explore the complexity of edge coloring in the …