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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:683611f1af961
DTSTART;TZID=America/Toronto:20200226T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20200226T140000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-complexity-bwt-runs-minimization-via-alphabet-reordering
SUMMARY:Seminar • Algorithms and Complexity — On the Complexity of\nBWT
 -runs Minimization via Alphabet Reordering
CLASS:PUBLIC
DESCRIPTION:Summary \n\nDANIEL GIBNEY\, DEPARTMENT OF COMPUTER SCIENCE\n_Un
 iversity of Central Florida_\n 
DTSTAMP:20250527T192641Z
END:VEVENT
END:VCALENDAR