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:69cff2f822e89
DTSTART;TZID=America/Toronto:20240301T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240301T133000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-david-aleman-0
SUMMARY:C&O Reading Group - David Aleman
CLASS:PUBLIC
DESCRIPTION:TITLE: A O(log log (rank) ) - competitive algorithm for the mat
 roid\nsecretary problem - Part 2\n\nSPEAKER:\n David Aleman\n\nAFFILIATION
 :\n University of Waterloo\n\nLOCATION:\n MC 6029\n\nABSTRACT: In this tal
 k we continue to review a O(log log(rank) ) -\ncompetitive algorithm for t
 he matroid secretary problem (MSP) due to\n Feldman\, Svensson and Zenklu
 sen\, where rank denotes the rank of the\ngiven matroid.
DTSTAMP:20260403T170352Z
END:VEVENT
END:VCALENDAR