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:69d28c0a24dd3
DTSTART;TZID=America/Toronto:20200618T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200618T110000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-algorithms-com
 plexity-simple-algorithm-minimum-cuts-in-near-linear-time-and-space-effici
 ent-data-structures-lattices
LOCATION:200 University Avenue West Online PhD seminar Waterloo ON N2L 3G1 
 Canada
SUMMARY:PhD Seminar • Algorithms and Complexity — A Simple Algorithm fo
 r\nMinimum Cuts in Near-Linear Time *and* Space-Efficient Data Structures\
 nfor Lattices
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THESE TWO PHD SEMINARS WILL BE GIVEN ONLINE.\n\nBR
 YCE SANDLUND\, PHD CANDIDATE\n_David R. Cheriton School of Computer Scien
 ce_
DTSTAMP:20260405T162130Z
END:VEVENT
END:VCALENDAR