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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d5e14a4e71a
DTSTART;TZID=America/Toronto:20181024T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20181024T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-power-constructive-proofs
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity — The Power of Constructive
 \nProofs
CLASS:PUBLIC
DESCRIPTION:ANTONINA KOLOKOLOVA\, DEPARTMENT OF COMPUTER SCIENCE\n_Memorial
  University of Newfoundland_\n\nA unifying theme in complexity theory in t
 he past few years has been\nthe duality between lower bounds and algorithm
 s. Indeed\, some of the\nmain recent lower bounds have been proven by deve
 loping better\nalgorithms. 
DTSTAMP:20260408T050202Z
END:VEVENT
END:VCALENDAR