Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Maximum Subarray ProblemCovers the Master method, maximum-subarray problem, and divide-and-conquer algorithmic paradigm.
Dataflow Analysis: OptimizationExplores dataflow analysis for optimization, including equations solving, live variables, reaching definitions, and very busy expressions.
Merge Sort: Divide-and-ConquerIntroduces Merge Sort, a divide-and-conquer algorithm for efficient array sorting, discussing correctness, runtime analysis, linear-time merging, and recurrence solving techniques.
