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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d60136e6bbe
DTSTART;TZID=America/Toronto:20251015T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20251015T130000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-sublinear-time-lower-bounds-for-approximating-matching-size-using-
 non-adaptive-queries
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Hybrid: DC 1304 | Online seminar Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity • Sublinear-Time Lower Boun
 ds\nfor Approximating Matching Size using Non-Adaptive Queries
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 1304 AND ONLINE
 .\n\nVIHAN SHAH\, UNIVERSITY OF BIRMINGHAM
DTSTAMP:20260408T071814Z
END:VEVENT
END:VCALENDAR