Progress on algorithmic versions of the Lovasz Local Lemma

Computer Science/Discrete Mathematics Seminar I
Topic:Progress on algorithmic versions of the Lovasz Local Lemma
Speaker:Aravind Srinivasan
Affiliation:University of Maryland, College Park
Date:Monday, April 7
Time/Room:11:15am - 12:15pm/S-101
Video Link:https://video.ias.edu/csdm/2014/0407-AravindSrinivasan

There has been substantial progress on algorithmic versions and generalizations of the Lovasz Local Lemma recently, with some of the main ideas getting simplified as well. I will survey some of the main ideas of Moser & Tardos, Pegden, and David Harris & myself in this context.