The gap between the known randomized and deterministic local distributed algorithms
underlies arguably the most fundamental and central open question in distributed graph …

We propose a new algorithmic framework, called partial rejection sampling, to draw samples
exactly from a product distribution, conditioned on none of a number of bad events …

Let Φ be a random k-CNF formula on n variables and m clauses, where each clause is a
disjunction of k literals chosen independently and uniformly. Our goal is, for most Φ, to …

This thesis contains a brief overview of my research activities between 2009 and 2017 as
Chargé de Recherche CNRS at the G-SCOP laboratory in Grenoble, France. I chose to …

The Lovász Local Lemma is a powerful probabilistic technique for proving the existence of
combinatorial objects. It is especially useful for coloring graphs and hypergraphs with …

The Lovasz Local Lemma is a seminal result in probabilistic combinatorics. It gives a
sufficient condition on a probability space and a collection of events for the existence of an …

Following the groundbreaking algorithm of Moser and Tardos for the Lovasz Local Lemma
(LLL), there has been a plethora of results analyzing local search algorithms for various …

We study the problem of sampling almost uniform proper $ q $-colourings in $ k $-uniform
simple hypergraphs with maximum degree $\Delta $. For any $\delta> 0$, if $ k\geq\frac {20 …

The Lopsided Lovász Local Lemma (LLLL) is a powerful probabilistic principle that has
been used in a variety of combinatorial constructions. While this principle began as a …

The Lovász Local Lemma (LLL) is a powerful tool in probability theory to show the existence
of combinatorial objects meeting a prescribed collection of “weakly dependent” criteria. We …