4 citations · 5 across the 6 of their papers we have counts for
3 papers · 1 filter
An interactive version of the Lovász local lemma
Lefteris Kirousis, John Livieratos, Kostas I. Psaromiligkos
Assume we are given (finitely many) mutually independent variables and (finitely many) "undesirable" events, each depending on a subset of the variables of at most elements, ca…
An alternative proof for the constructive Asymmetric Lovász Local Lemma
Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos +1
We provide an alternative constructive proof of the Asymmetric Lovász Local Lemma. Our proof uses the classic algorithmic framework of Moser and the analysis introduced by Giotis,…
Acyclic Edge Coloring through the Lovász Local Lemma
Ioannis Giotis, Lefteris Kirousis, Kostas I. Psaromiligkos +1
We give a probabilistic analysis of a Moser-type algorithm for the Lovász Local Lemma (LLL), adjusted to search for acyclic edge colorings of a graph. We thus improve the best know…