Magnús M. Halldórsson

most citedOvercoming Congestion in Distributed Coloring

1 citations · 2 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2022★ 1 cited

Fast Distributed Brooks' Theorem

Manuela Fischer, Yannic Maus, Magnús M. Halldórsson

We give a randomized $Δ$ -coloring algorithm in the LOCAL model that runs in $poly lo g lo g n$ rounds, where $n$ is the number of nodes of the input graph and $Δ$ is its max…

cs.DC2022★ 1 cited

Overcoming Congestion in Distributed Coloring

Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan

We present a new technique to efficiently sample and communicate a large number of elements from a distributed sampling space. When used in the context of a recent LOCAL algorithm…