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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cfdfc9dde45
DTSTART;TZID=America/Toronto:20231201T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231201T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-samuel-jaques
SUMMARY:Tutte Colloquium - Samuel Jaques
CLASS:PUBLIC
DESCRIPTION:TITLE: Wires\, bits\, and the cost of sorting\n\nSpeaker:\n Sa
 muel Jaques\n\nAffiliation:\n University of Waterloo\n\nLocation:\n MC 550
 1\n\nABSTRACT: How hard is it to sort a list of n integers? A basic cours
 e\non algorithms says it's O(n log n) time\, but what if the list is\nenor
 mous - so big you would need to cover the surface of the moon just\nto sto
 re it?
DTSTAMP:20260403T154201Z
END:VEVENT
END:VCALENDAR