The following pages link to Moser and tardos meet Lovász (Q5419093):
Displayed 19 items.
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas (Q743431) (← links)
- Comparison of two convergence criteria for the variable-assignment Lopsided Lovász Local Lemma (Q2094876) (← links)
- Directed Lovász local lemma and Shearer's lemma (Q2294597) (← links)
- Ergodic theorems for the shift action and pointwise versions of the Abért-Weiss theorem (Q2303689) (← links)
- Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas (Q2693173) (← links)
- Commutativity in the Algorithmic Lovász Local Lemma (Q4555400) (← links)
- A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
- An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles (Q4960448) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- Approximately counting bases of bicircular matroids (Q4993123) (← links)
- (Q5002746) (← links)
- (Q5009540) (← links)
- New bounds for the Moser‐Tardos distribution (Q5120743) (← links)
- A short proof of Bernoulli disjointness via the local lemma (Q5130866) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)