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:69cf6bf725d62
DTSTART;TZID=America/Toronto:20241025T123000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241025T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-parth-mittal
SUMMARY:C&O Reading Group - Parth Mittal
CLASS:PUBLIC
DESCRIPTION:TITLE:Nearly optimal communication and query complexity of bipa
 rtite\nmatching \n\nSPEAKER:\n Parth Mittal\n\nAFFILIATION:\n University 
 of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT:I will talk about a recent 
 paper (Blikstad\, van den Brand\,\nEfron\, Mukhopadhyay\, Nanongkai\, FOCS
  22) which gives near-optimal\nalgorithms for bipartite matching (and seve
 ral generalizations) in\ncommunication complexity\, and several types of q
 uery complexity. We\nwill focus only on the simplest case (i.e. unweighted
  bipartite\nmatching)\,and will not assume any background on communication
  or query\ncomplexity.
DTSTAMP:20260403T072751Z
END:VEVENT
END:VCALENDAR