Lectures related to Algorithm | EPFL Graph Search

Covers Belief Propagation, a key method for both analysis and algorithm.

Explores dynamic programming for palindromic subsequences, merging binary search trees, and finding the median of two sorted arrays.

Covers the Hidden Subgroup Algorithm in quantum computing, emphasizing projectors and measurement postulates.

Provides a detailed review of the 2016 final exam, covering various algorithmic problems.

Explores the challenges of Navier-Stokes equations, pressure checkerboard, staggered grid, and the SIMPLE algorithm.

Explains the winning strategy in Connect Four by checking for winning combinations.

Explores the Master method, the Maximum Subarray Problem, and optimal solution structures.

Introduces greedy algorithms and matroids, highlighting their efficiency in solving optimization problems.

Covers basic algorithm ingredients, search algorithms, control structures, and algorithm correctness.