Lectures related to Competitive analysis (online algorithm)

Covers online algorithms and competitive ratio in caching strategies to optimize memory usage.

Theory of Computation Laboratory 2: Resource Allocation and Network Design

Explores approximation algorithms for resource allocation and network design problems, competitive algorithms for the TCP acknowledgment problem, and experimental results.

Cutting Plane Methods

Explores cutting plane methods, ellipsoid algorithm, and competitive algorithms for optimization.

Online Matching in Evolving Environments

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

Quick Sort: In-place Subdivision

Explains the in-place subdivision method for quicksort with a unique pivot, covering its temporal complexity.