Explore the concept of finding monotone patterns in sublinear time in this 20-minute IEEE conference talk. Delve into the problem description, naive algorithm, and partial order theorem. Examine the longest increasing subsequence and previous results. Analyze running time, lower and upper bounds, and increasing subsequences. Learn about the split of intervals, iteration, and growing suffixes. Discover the algorithm and adaptive algorithms for testing all patterns. Gain insights into efficient pattern recognition techniques and their applications in computer science and data analysis.
Overview
Syllabus
Introduction
Problem description
Naive algorithm
Partial order theorem
Longest increasing subsequence
Previous results
Running time
Lower bound
Upper bound
Increasing subsequences
Split of intervals
Iteration
Growing suffixes
Algorithm
Adaptive Algorithms
Testing for all patterns
Conclusion
Taught by
IEEE FOCS: Foundations of Computer Science
