Deterministic Algorithms for the Lovász Local Lemma
From MaRDI portal
Publication:5408761
DOI10.1137/100799642zbMath1290.68053OpenAlexW2156584294WikidataQ124922462 ScholiaQ124922462MaRDI QIDQ5408761
Karthekeyan Chandrasekaran, Bernhard Haeupler, Navin Goyal
Publication date: 11 April 2014
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/60165
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Parallel algorithms in computer science (68W10)
Related Items (12)
Conflict-free coloring bounds on open neighborhoods ⋮ Counting Solutions to Random CNF Formulas ⋮ Derandomizing local distributed algorithms under bandwidth restrictions ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ A short note on conflict‐free coloring on closed neighborhoods of bounded degree graphs ⋮ Unnamed Item ⋮ Nonrepetitive colouring via entropy compression ⋮ Reliable communication over highly connected noisy networks ⋮ An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles ⋮ Distributed algorithms for the Lovász local lemma and graph coloring ⋮ Finding independent transversals efficiently ⋮ The local cut lemma
This page was built for publication: Deterministic Algorithms for the Lovász Local Lemma
