Lectures related to Greedy Change-Making Algorithm: Optimality and Stability

Explores linear search, insertion sort, coin change, maximum matching, and the halting problem in algorithms.

Covers the formulation of optimization programs for minimizing piecewise linear cost functions.

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Explores online matching in evolving environments, addressing challenges and solutions for adapting algorithms to changing data.