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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d5a418ad622
DTSTART;TZID=America/Toronto:20220427T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220427T130000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-complex
 ity-worst-case-to-average-case-reductions-via-additive-combinatorics
LOCATION:200 University Avenue West Online seminar Waterloo ON N2L 3G1 Cana
 da
SUMMARY:Seminar • Algorithms and Complexity • Worst-Case to Average-Cas
 e\nReductions via Additive Combinatorics
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL BE GIVEN ONLINE.\n\nVAHID ASADI\
 , PHD CANDIDATE\n_David R. Cheriton School of Computer Science_\n\nWe pres
 ent a new framework for designing worst-case to average-case\nreductions. 
 For a large class of problems\, it provides an explicit\ntransformation of
  algorithms running in time T that are only correct\non a small (subconsta
 nt) fraction of their inputs into algorithms\nrunning in time O(T \\log T)
  that are correct on all inputs.
DTSTAMP:20260408T004056Z
END:VEVENT
END:VCALENDAR