Lectures related to Longest Common Subsequence: Dynamic Programming Algorithm

Explores dynamic programming with Bellman-Ford, Dijkstra, greedy strategies, and activity scheduling problems.

Explores dynamic programming for the Knapsack Problem, optimizing weight accumulation and profit subsets efficiently.

Explores reliable broadcast in distributed systems, presenting specifications, algorithms, and properties for different types of broadcast.

Explores total order broadcast and its equivalence to consensus in reliable systems.

Introduces Dijkstra's algorithm and probabilistic analysis through the Hiring Problem.

Explores transference bounds, ellipsoids, and determining the shortest vector.