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:69d1173497bda
DTSTART;TZID=America/Toronto:20210816T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210816T130000
URL:https://uwaterloo.ca/computer-science/events/masters-thesis-presentatio
 n-algorithms-and-complexity-extremely-fast-a-b-trees-at-all-contention-lev
 els
LOCATION:200 University Avenue West Online master’s thesis presentation W
 aterloo ON N2L 3G1 Canada
SUMMARY:Master’s Thesis Presentation • Algorithms and Complexity •\nE
 xtremely Fast (a\,b)-trees at all Contention Levels
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS MASTER’S THESIS PRESENTATION WILL BE GIVEN 
 ONLINE.\n\nANUBHAV SRIVASTAVA\, MASTER’S CANDIDATE\n_David R. Cheriton S
 chool of Computer Science_\n\nSUPERVISOR: Professor Trevor Brown\n\nThe or
 dered dictionary is one of the most fundamental abstract data\ntypes. It s
 tores a set of key-value pairs\, and supports operations to\ninsert\, remo
 ve and retrieve key-value pairs. It can also support range\nquery operatio
 ns.
DTSTAMP:20260404T135044Z
END:VEVENT
END:VCALENDAR