1 citations · 1 across the 4 of their papers we have counts for
10 papers
LOCAL LLL in Rounds
Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson +2
We provide a -round randomized LOCAL algorithm for the constructive Lovász Local Lemma with polynomial criterion , for a sufficiently l…
Beyond Brooks: -Coloring in Semi-Streaming
Maxime Flin, Magnús M. Halldórsson
Reed [J.~Comb.~Theory B, 1999] showed that graphs of maximum degree without -cliques are -colorable. We design a one-pass semi-streaming algorithm for com…
Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
Maxime Flin, Magnús M. Halldórsson, Manuel Jakob +1
For any , let be the maximum integer such that . We give a distributed \LOCAL algorithm that, given an integer , computes a valid -color…
Streaming Diameter of High-Dimensional Points
Magnús M. Halldórsson, Nicolaos Matsakis, Pavel Veselý
We improve the space bound for streaming approximation of Diameter but also of Farthest Neighbor queries, Minimum Enclosing Ball and its Coreset, in high-dimensional Euclidean spac…
Faster Dynamic -Coloring Against Adaptive Adversaries
Maxime Flin, Magnús M. Halldórsson
We consider the problem of maintaining a proper -vertex coloring in a graph on -vertices and maximum degree undergoing edge insertions and deletions. We give a rando…
When MIS and Maximal Matching are Easy in the Congested Clique
Keren Censor-Hillel, Tomer Even, Maxime Flin +1
Two of the most fundamental distributed symmetry-breaking problems are that of finding a maximal independent set (MIS) and a maximal matching (MM) in a graph. It is a major open qu…
Decentralized Distributed Graph Coloring II: degree+1-Coloring Virtual Graphs
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
Graph coloring is fundamental to distributed computing. We give the first general treatment of the coloring of virtual graphs, where the graph to be colored is locally embedded…
Distributed Delta-Coloring under Bandwidth Limitations
Yannic Maus, Magnús M. Halldórsson
We consider the problem of coloring graphs of maximum degree with colors in the distributed setting with limited bandwidth. Specifically, we give a $\mathsf{poly}\log\log n…
Distributed Lovász Local Lemma under Bandwidth Limitations
Magnús M. Halldórsson, Yannic Maus, Saku Peltonen
The constructive Lovász Local Lemma has become a central tool for designing efficient distributed algorithms. While it has been extensively studied in the classic LOCAL model that…
Fast Coloring Despite Congested Relays
Maxime Flin, Magnús M. Halldórsson, Alexandre Nolin
We provide a -round randomized algorithm for distance-2 coloring in CONGEST with colors. For , this improves exponentially…