BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260427T194930Z
UID:577e0991f2bac820666633@ist.ac.at
DTSTART:20171002T160000
DTEND:20171002T170000
DESCRIPTION:Speaker: Robert Tarjan\nhosted by GSO\nAbstract: This talk will
  present the zip tree\, a simple and efficient type of binary search tree.
   Zip trees use randomization to achieve balance.  A zip tree can be vie
 wed as a binary-tree representation of a skip list or as a variant of a tr
 eap.  Insertion and deletion avoid the multiplicity of cases that arise i
 n standard balanced trees.  Zip trees can be adapted to exploit biased ac
 cess distributions.  Their simplicity makes them promising for concurrent
  use.\n
LOCATION:Raiffeisen Lecture Hall\, Central Building\, ISTA
ORGANIZER:kzaruba@ist.ac.at
SUMMARY:Robert Tarjan: Zip trees
URL:https://talks-calendar.ista.ac.at/events/26
END:VEVENT
END:VCALENDAR