Lectures related to Maximum Subarray Problem

Dynamic Programming: Optimal Decision Making

Explores dynamic programming for optimizing decision-making processes over time, using real-world examples like oil extraction and stock trading.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Matrix Multiplication and Divide-and-Conquer Techniques

Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.

Complexity & Induction: Algorithms & Proofs

Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.

Algorithms in Computer Science: Search and Sort Techniques

Provides an overview of essential search and sort algorithms in computer science.

Algorithms & Growth of Functions

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Untitled

Algorithms: Final Exam Review

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

Analysis of Algorithms

Covers the analysis of algorithms, focusing on insertion sort and computational models.

Search Algorithms: Abductive Reasoning

Covers search algorithms, focusing on abductive reasoning and heuristic search strategies.

Introduction to Algorithms

Introduces the importance of studying algorithms, presents a clever algorithm for calculating an arithmetic series, and discusses efficiency and correctness in algorithms.

Dynamic Programming: Rod Cutting and Matrix Chain Multiplication

Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.

Search Algorithms: Two Examples

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

Search Algorithms: Abductive Reasoning

Explores abductive reasoning, search algorithms, and heuristic search for problem-solving.

The Backpack Problem

Introduces the backpack problem, a discrete optimization problem with constraints and algorithms to solve it.

Minimum Spanning Trees: Prim's Algorithm

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Reliable Broadcast: Overview and Algorithms

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

Linear Programming: Extreme Points

Explores extreme points in linear programming and the role of constraints in finding optimal solutions.

Dynamic Programming: Palindromic Subsequences

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

Entropy and Algorithms: Applications in Sorting and Weighing

Covers the application of entropy in algorithms, focusing on sorting and decision-making strategies.