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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68307b6004357
DTSTART;TZID=America/Toronto:20210407T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210407T130000
URL:/computer-science/events/phd-defence-data-structure
 s-and-algorithms-efficient-data-structures-for-partial-orders-range-modes-
 and-graph-cuts
SUMMARY:PhD Defence • Data Structures and Algorithms — Efficient Data\n
 Structures for Partial Orders\, Range Modes\, and Graph Cuts
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS PHD DEFENCE WILL BE GIVEN ONLINE.
 \n\nBRYCE SANDLUND\, PHD CANDIDATE\n_David R. Cheriton School of Computer
  Science_\n\nSUPERVISOR: Professor J. Ian Munro\n\nThis thesis considers 
 the study of data structures from the\nperspective of the theoretician\, w
 ith a focus on simplicity and\npracticality. We consider both the time com
 plexity as well as space\nusage of proposed solutions. Topics discussed fa
 ll in three main\ncategories: partial order representation\, range modes\,
  and graph cuts.\n 
DTSTAMP:20250523T134256Z
END:VEVENT
END:VCALENDAR