M. Ghaffari

activity

20092026

most citedSublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy

47 citations · 207 across the 54 of their papers we have counts for

collaborators

Showing 2026Show all

2 papers · 1 filter

cs.DS2026

LOCAL LLL in $poly (lo g lo g n)$ Rounds

Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson +2

We provide a $poly (lo g lo g n)$ -round randomized LOCAL algorithm for the constructive Lovász Local Lemma with polynomial criterion $p d^{c} < 1$ , for a sufficiently l…

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…

LOCAL LLL in poly(loglogn) Rounds

Robust Shattering Arguments

LOCAL LLL in $poly (lo g lo g n)$ Rounds