Explore dynamic algorithms for Longest Increasing Subsequence (LIS) and Distance to Monotonicity in this informative conference talk. Delve into problem definitions, Patience Sorting, and the dynamic setting before examining previous work and new results. Learn about runtime improvements, grid packing techniques, and an enhanced algorithm for LIS. Gain valuable insights into these fundamental computer science concepts and their practical applications in algorithmic problem-solving.
Dynamic Algorithms for LIS and Distance to Monotonicity
Association for Computing Machinery (ACM) via YouTube
Overview
Syllabus
Intro
Problem Definition
Patience Sorting
Dynamic Setting
Previous Work
Our Results
Improving the runtime
Grid Packing
Improved Algorithm for LIS
Taught by
Association for Computing Machinery (ACM)
Related Courses
-
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
5.0 -
Algorithmic Toolbox
3.6 -
Algorithmic Design and Techniques
3.7 -
Simple Steps for Solving Dynamic Programming Problems
-
Design and Analysis of Algorithms
5.0 -
Matthias Mnich - Time- and Space-Optimal Algorithms for the Many-Visits TSP
