11 citations · 42 across the 12 of their papers we have counts for
19 papers
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…
Distributed Vertex Cover Reconfiguration
Keren Censor-Hillel, Yannic Maus, Shahar Romem-Peled +1
Reconfiguration schedules, i.e., sequences that gradually transform one solution of a problem to another while always maintaining feasibility, have been extensively studied. Most r…
Ultrafast Distributed Coloring of High Degree Graphs
Magnús M. Halldórsson, Alexandre Nolin, Tigran Tonoyan
We give a new randomized distributed algorithm for the -list coloring problem. The algorithm and its analysis dramatically simplify the previous best result known of Chang, Li…
Fault Tolerant Max-Cut
Keren Censor-Hillel, Noa Marelly, Roy Schwartz +1
In this work, we initiate the study of fault tolerant Max Cut, where given an edge-weighted undirected graph , the goal is to find a cut that maximizes the…
Efficient Randomized Distributed Coloring in CONGEST
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus +1
Distributed vertex coloring is one of the classic problems and probably also the most widely studied problems in the area of distributed graph algorithms. We present a new randomiz…