Session 6A - Dynamic Algorithms for LIS and Distance to Monotonicity

About this video

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

Explains dynamic algorithms for the longest increasing subsequence problem and distance-to-monotonicity metric. A technical conference session teaching concrete algorithmic techniques.

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

Part of STOC 2020