11 papers:
STOC-2015-BansalGG #graph #independence #on the #set- On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
ICALP-v2-2015-AisenbergBBCI #principle #proving- Short Proofs of the Kneser-Lovász Coloring Principle (JA, MLB, SB, AC, GI), pp. 44–55.
SAT-2014-IstrateC #complexity #proving #theorem- Proof Complexity and the Kneser-Lovász Theorem (GI, AC), pp. 138–153.
- STOC-2011-KolipakaS
- Moser and tardos meet Lovász (KBRK, MS), pp. 235–244.
- STOC-2010-AmbainisKS #quantum
- A quantum lovász local lemma (AA, JK, OS), pp. 151–160.
- ICALP-v1-2010-Welzl #constraints #satisfiability
- When Conflicting Constraints Can Be Resolved — The Lovász Local Lemma and Satisfiability (EW), p. 18.
- STOC-2009-Moser #proving
- A constructive proof of the Lovász local lemma (RAM), pp. 343–350.
- STOC-2007-Dantchev #complexity #proving #rank
- Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems (SSD), pp. 311–317.
- ICALP-v1-2006-KojevnikovI #bound #calculus #proving
- Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
- ICALP-2005-BeamePS #bound #communication #complexity #multi
- Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (PB, TP, NS), pp. 1176–1188.
- STOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
- A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (AC, CS), pp. 38–47.
