BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T212314Z
UID:Seminar-dept-1241@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20240716T130000
DTEND:20240716T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Wanchote Po Jiamjitrak: An Analysis of Binary Search Trees using Forbidden Submatrices\n\nBinary search trees (BSTs) are one the most fundamental data structures in computer science. The long-standing conjecture "dynamic optimality" states that there exists an online BST algorithm with an offline optimal cost for any access sequence. \n\n\n\nIn this talk, we will explore BSTs from a geometric perspective and explore the greedy algorithm, which is arguably considered to be the most promising candidate for the dynamic optimality conjecture. Then, we will analyze the cost of the greedy algorithm using the mathematical tool "forbidden submatrices".\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1241
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR