Constructive Aspects of the Lovasz Local Lemma and their Applications


Aravind Srinivasan University of Maryland Department of Computer Science A.V. Williams Building College Park,


Tuesday, 2 August 2011 (All day)


  • A-212 (STCS Seminar Room)

Recent years have seen significant progress on the algorithmic aspects of the Lovasz Local Lemma: e.g., one can now handle super-polynomially many events that need to be avoided. I will survey this general area, as well as my joint work with Bernhard Haeupler and Barna Saha.