Algorithms for Big Data (COMPSCI 229r), Lecture 8

Algorithms for Big Data (COMPSCI 229r), Lecture 8 This lecture explores dynamic programming in the streaming model, specifically focusing on computing the longest increasing subsequence and distance to monotonicity. The discussion covers space-efficient randomized algorithms, compares their complexity to deterministic approaches, and addresses theoretical challenges in maintaining DP tables with sublinear space requirements.