Session 9A - Unbounded lower bound for k-server against weak adversaries

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidence

Establishes unbounded lower bounds for the k-server problem against weak adversaries, a fundamental problem in online algorithms. Presents a specific hardness result with formal proof techniques.

A 25-minute video from Association for Computing Machinery (ACM): “Session 9A - Unbounded lower bound for k-server against weak adversaries”.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020