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:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d7deacee140
DTSTART;TZID=America/Toronto:20190522T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190522T133000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-combinatorics-furthest-and
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity — The Combinatorics of\nFur
 thest and Nearest Values
CLASS:PUBLIC
DESCRIPTION:LILY WANG\, UNIVERSITY OF WATERLOO\n\nA classical problem asks 
 us to find\, for each element $A[i]$ of an\narray of integers\, the positi
 on of the nearest smallest element.\nSimilarly\, we can ask about the dual
  problem: for each element of an\narray of integers $A[i]$\, what is the p
 osition of the furthest smaller\nelement? 
DTSTAMP:20260409T171524Z
END:VEVENT
END:VCALENDAR