BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Anton Bernshteyn (Georgia Tech)
DTSTART:20201127T140000Z
DTEND:20201127T150000Z
DTSTAMP:20260423T020956Z
UID:WCS/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/12/">Mea
 surable colorings\, the Lovász Local Lemma\, and distributed algorithms</
 a>\nby Anton Bernshteyn (Georgia Tech) as part of Warwick Combinatorics Se
 minar\n\n\nAbstract\nIn the past twenty or so years\, a rich theory has em
 erged concerning the behavior of graph colorings\, matchings\, and other c
 ombinatorial notions under additional regularity requirements\, for instan
 ce measurability. It turns out that this area is closely related to distri
 buted computing\, i.e.\, the part of computer science concerned with probl
 ems that can be solved efficiently by a decentralized network of processor
 s. A key role in this relationship is played by the Lovász Local Lemma an
 d its analogs in the measurable setting. In this talk I will outline this 
 relationship and present a number of applications.\n
LOCATION:https://researchseminars.org/talk/WCS/12/
END:VEVENT
END:VCALENDAR