Magnús M. Halldórsson

activity

20212026

most citedLocally Differentially Private Sparse Vector Aggregation

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

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Robust Shattering Arguments

Mohsen Ghaffari, Magnús M. Halldórsson, Yannic Maus +1

Graph shattering is a central technique underlying sublogarithmic-time distributed algorithms in the LOCAL model. Its analysis typically relies on bounding the probability that lar…

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.DS2022

Fast Distributed Vertex Splitting with Applications

Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin

We present $poly lo g lo g n$ -round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into $k$ parts such that a node of de…