YoVDO

Online List Labeling - Breaking the Log^2 N Barrier

Offered By: Simons Institute via YouTube

Tags

Data Structures Courses Algorithm Design Courses Dynamic Graphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking lecture on the online list labeling problem, a fundamental concept in data structures. Delve into the challenge of storing a dynamically-changing set of n items in an array of m slots while maintaining sorted order. Learn about the historical O(log^2 n) upper bound for item movements per insertion/deletion and the existing gap between upper and lower bounds for randomized algorithms. Discover a new randomized data structure that achieves an expected O(log^{3/2} n) items moved per operation, breaking the long-standing log^2 n barrier. Gain insights into the collaborative research behind this advancement in dynamic graphs and algorithm design.

Syllabus

Online List Labeling: Breaking the log^2 n Barrier


Taught by

Simons Institute

Related Courses

Data Visualization GUIs with Dash and Python
YouTube
How to Get Started With Graph ML - Blog Walkthrough
Aleksa Gordić - The AI Epiphany via YouTube
Temporal Graph Networks - GNN Paper Explained
Aleksa Gordić - The AI Epiphany via YouTube
Parallel Batch-Dynamic Graph Representations
Simons Institute via YouTube
Dynamic Algorithms for Center on Graphs
Simons Institute via YouTube