Lectures related to Communication complexity

Covers complexity analysis, pseudo-code, and algorithm justification through examples and theoretical explanations.

Presents a generalized optimistic framework for solving convex-concave saddle point problems, extending to higher-order methods.

Explores algorithm complexity, analyzing efficiency and worst-case scenarios of sorting algorithms.

Covers matrix notation, arithmetic, multiplication, algorithms, and complexity of matrix multiplication.

Covers the complexity analyses of search and sorting algorithms.

Covers the basics of object-oriented programming in C++, including encapsulation, abstraction, and the importance of grouping data and methods.