2 citations · 4 across the 4 of their papers we have counts for
5 papers
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…
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 rounds, where is the number of nodes of the input graph and is its max…
Fast Distributed Vertex Splitting with Applications
Magnús M. Halldórsson, Yannic Maus, Alexandre Nolin
We present -round randomized distributed algorithms to compute vertex splittings, a partition of the vertices of a graph into parts such that a node of de…
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…
Locally Differentially Private Sparse Vector Aggregation
Mingxun Zhou, Tianhao Wang, T-H. Hubert Chan +2
Vector mean estimation is a central primitive in federated analytics. In vector mean estimation, each user holds a real-valued vector , and a server w…