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:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6837e2ae84c8b
DTSTART;TZID=America/Toronto:20200527T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200527T103000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-can-algebraic-circuit-lower-bounds-have-easy-proofs
SUMMARY:Seminar • Algorithms and Complexity — Can Algebraic Circuit Low
 er\nBounds Have Easy Proofs?
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL BE GIVEN ONLINE.\n\n
 ANAMAY TENGSE\n_Tata Institute of Fundamental Research (TIFR)_\n 
DTSTAMP:20250529T042934Z
END:VEVENT
END:VCALENDAR