Lazy Search Tree

Explore the concept of Lazy Search Trees in this 25-minute IEEE conference talk by Bryce Sandlund from the University of Waterloo and Sebastian Wild from the University of Liverpool. Delve into the problem description, existing sorted dictionaries, and the motivation behind this novel data structure. Examine a related idea of multiple selection and discuss the shortfalls of related work. Learn how to choose rank r, understand the intuition behind Lazy Search Trees, and grasp the complexity goals. Gain insights into the technical overview, priority queue complexities, and specific results. Discover potential applications for Lazy Search Trees in various computational scenarios.

Intro
Problem Description
Existing Sorted Dictionaries
Motivation
A Related Idea - Multiple Selection
Related Work - Shortfalls
How to Choose Rank r?
Intuition
Complexity Goal
Technical Overview
Priority Queue Complexities
Specific Results
Applications