Tata Institute of Fundamental Research

Constructive Aspects of the Lovasz Local Lemma and their Applications

Speaker: Aravind Srinivasan University of Maryland Department of Computer Science A.V. Williams Building College Park,
Date: Tuesday, 2 Aug 2011 (all day)
Venue: A-212 (STCS Seminar Room)

(Scan to add to calendar)
Abstract:  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.