The network scenario offers interesting new perspectives on the phenomenon of quantum
nonlocality. Notably, when considering networks with independent sources, it is possible to …

In this dissertation we study how efficiently quantum computers can solve various problems,
and how large speedups can be achieved compared to classical computers. In particular we …

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 give a fully polynomial-time approximation scheme (FPTAS) to count the number of q-
colorings for k-uniform hypergraphs with maximum degree Δ if k≥ 28 and q> 315Δ14/k− 14 …

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos developed a simple
and powerful algorithm to find solutions to constraint satisfaction problems. Kolipaka and …

The Lov\'asz Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics
that is used to verify the existence of combinatorial objects with desirable properties. Recent …

Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to
show the possibility of avoiding all “bad” events under some “weakly dependent” condition …

In this Ph. D thesis, we work in one of the most well studied class of problems in Computer
Science, that of Constraint Satisfaction Problems (CSPs). In one of their usual formulations …

Abstract Moser and Tardos (J. ACM (JACM) 57 (2), 11 2010) gave an algorithmic proof of the
lopsided Lovász local lemma (LLL) in the variable framework, where each of the …

Stochastic Local Search and the Lovász Local Lemma By Fotios Iliopoulos A dissertation
submitted in partial satisfaction of the Page 1 Stochastic Local Search and the Lovász Local …