BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260414T083642Z
UID:Seminar-dept-1059@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20230727T130000
DTEND:20230727T140000
SUMMARY:School Seminar Series
DESCRIPTION:Benjamin Berendsohn: Search trees on trees\n\nSearch trees on trees (STTs) are a generalization of binary search trees (BSTs). Where the key space of a BST is a totally ordered set, the key space of an STT is a tree.\n\nBoth the dynamic and the static BST model can be adapted to the setting of STTs, and I will present some results from both areas. This includes approximation algorithms for STTs with optimal expected search time, and a generalization of the Splay Tree data structure to the STT setting.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1059
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR