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:6832ebf469cc2
DTSTART;TZID=America/Toronto:20220427T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20220427T130000
URL:/computer-science/events/seminar-algorithms-complex
 ity-worst-case-to-average-case-reductions-via-additive-combinatorics
SUMMARY:Seminar • Algorithms and Complexity • Worst-Case to Average-Cas
 e\nReductions via Additive Combinatorics
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL BE GIVEN ONLINE.\n\n
 VAHID ASADI\, PHD CANDIDATE\n_David R. Cheriton School of Computer Science
 _\n\nWe present a new framework for designing worst-case to average-case\n
 reductions. For a large class of problems\, it provides an explicit\ntrans
 formation of algorithms running in time T that are only correct\non a smal
 l (subconstant) fraction of their inputs into algorithms\nrunning in time 
 O(T \\log T) that are correct on all inputs.\n 
DTSTAMP:20250525T100748Z
END:VEVENT
END:VCALENDAR