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:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20171105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d8dbdbeaf54
DTSTART;TZID=America/Toronto:20180404T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20180404T133000
URL:https://uwaterloo.ca/computer-science/events/phd-seminar-algorithms-and
 -complexity-succinct-color
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:PhD Seminar • Algorithms and Complexity: Succinct Color Searching
  in\nOne Dimension
CLASS:PUBLIC
DESCRIPTION:HICHAM EL-ZEIN\, PHD CANDIDATE\n_David R. Cheriton School of Co
 mputer Science_\n\nWe present succinct data structures for one-dimensional
  color\nreporting and color counting problems. We are given a set of $n$\n
 points with integer coordinates in the range $[1\,m]$ and every point\nis 
 assigned a color from the set $\\{\\\,1\,\\ldots\,\\sigma\\\,\\}$. A color
 \nreporting query asks for the list of distinct colors that occur in a\nqu
 ery interval $[a\,b]$ and a color counting query asks for the number\nof d
 istinct colors in $[a\,b]$.
DTSTAMP:20260410T111539Z
END:VEVENT
END:VCALENDAR