BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf6add663b1
DTSTART;TZID=America/Toronto:20240624T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240624T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-rian-neogi-3
SUMMARY:C&O Reading Group - Rian Neogi
CLASS:PUBLIC
DESCRIPTION:TITLE: Bipartite Perfect Matching is in Quasi-NC\n\nSPEAKER:\n
  Rian Neogi\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 602
 9\n\nABSTRACT: Mulmuley\, Vazirani\, and Vazirani gave a randomized paral
 lel\nalgorithm for checking whether a perfect matching exists in a graph.\
 nIn doing so\, they came up with the infamous isolation lemma\, which\nfou
 nd several uses in other areas of computer science. The isolation\nlemma i
 s inherently randomized\, and it has been a long-standing open\nproblem to
  derandomize the lemma. In this talk\, I will go over the\nbreakthrough wo
 rk of Fenner\, Gurjar\, and Thierauf where they almost\ncompletely derando
 mize the isolation lemma in the special case when\napplied to the bipartit
 e perfect matching problem. In doing so\, they\ngive a deterministic paral
 lel algorithm for perfect matching that uses\na quasi-polynomial number of
  processors.
DTSTAMP:20260403T072309Z
END:VEVENT
END:VCALENDAR