Fetching the paper…
Reading the bibliography…
We give an algorithmic local lemma by establishing a sufficient condition for the uniform random walk on a directed graph to reach a sink quickly.
Problems and results on 3 3 -chromatic hypergraphs and some related questions
Paul Erdős and László Lovász · 1975
Earlier work this paper cites.
Asymptotic lower bounds for ramsey functions
Joel Spencer · 1977
Earlier work this paper cites.
On a problem of Spencer
James B. Shearer · 1985
Earlier work this paper cites.
A parallel algorithmic version of the local lemma
Noga Alon · 1991
Earlier work this paper cites.
An algorithmic approach to the Lovász local lemma. I
József Beck · 1991
Earlier work this paper cites.
Lopsided Lovász local lemma and latin transversals
Paul Erdös and Joel Spencer · 1991
Earlier work this paper cites.
On selecting a satisfying truth assignment
Christos H. Papadimitriou · 1991
Earlier work this paper cites.
The cutoff phenomenon in finite markov chains
Persi Diaconis · 1996
Earlier work this paper cites.
Further algorithmic aspects of the local lemma
Michael Molloy and Bruce Reed · 1999
Earlier work this paper cites.
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma
Artur Czumaj and Christian Scheideler · 2000
Earlier work this paper cites.
Vertex colouring edge partitions
Louigi Addario-Berry, Robert E.L. Aldred, Ketan Dalal, and Bruce A. Reed · 2005
Cited alongside, same era.
Improved algorithmic versions of the Lovász local lemma
Aravind Srinivasan · 2008
Cited alongside, same era.
A constructive proof of the Lovász local lemma
Robin A. Moser · 2009
Cited alongside, same era.
Deterministic algorithms for the Lovász local lemma
Karthekeyan Chandrasekaran, Navin Goyal, and Bernhard Haeupler · 2010
Cited alongside, same era.
New constructive aspects of the Lovász local lemma
Bernhard Haeupler, Barna Saha, and Aravind Srinivasan · 2010
Cited alongside, same era.
A constructive proof of the general Lovász local lemma
Robin A. Moser and Gábor Tardos · 2010
Cited alongside, same era.
Rainbow hamilton cycles in uniform hypergraphs
Andrzej Dudek, Alan M. Frieze, and Andrzej Rucinski · 2012
Later among the works it cites.
A sharper local lemma with improved applications
Kashyap Kolipaka, Mario Szegedy, and Yixin Xu · 2012
Later among the works it cites.
Extensions of results on rainbow hamilton cycles in uniform hypergraphs
Andrzej Dudek and Michael Ferrara · 2013
Later among the works it cites.
The Moser-Tardos framework with partial resampling
David G. Harris and Aravind Srinivasan · 2013
Later among the works it cites.
Can colour-blind distinguish colour palettes?
Rafał Kalinowski, Monika Pilśniak, Jakub Przybyło, and Mariusz Woźniak · 2013
Later among the works it cites.
Quest for negative dependency graphs
Linyuan Lu, Austin Mohr, and László Székely · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An improvement of the Lovász local lemma via cluster expansion
Rodrigo Bissacot, Roberto Fernández, Aldo Procacci, and Benedetto Scoppola · 2011
Cited alongside, same era.
Moser and Tardos meet Lovász
Kashyap Babu Rao Kolipaka and Mario Szegedy · 2011
Cited alongside, same era.
Highly nonrepetitive sequences: Winning strategies from the local lemma
Wesley Pegden · 2011
Cited alongside, same era.
An improvement of the moser-tardos algorithmic local lemma
Wesley Pegden · 2011
Cited alongside, same era.
Applications of the Lopsided Lovász Local Lemma Regarding Hypergraphs
Austin Mohr · 2013
Later among the works it cites.
The Lovász local lemma - a survey
Mario Szegedy · 2013
Later among the works it cites.
A constructive algorithm for the Lovász local lemma on permutations
David G. Harris and Aravind Srinivasan · 2014
Closest in time.