Lectures related to Matrix Multiplication and Heaps: Efficient Algorithms

Matrix Multiplication and Divide-and-Conquer Techniques

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

Heaps and Priority Queues

Explores heaps, heapsort, and priority queues, including operations and analysis.

Algorithms in Computer Science: Search and Sort Techniques

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

Matrix Multiplication: Strassen's Algorithm

Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.

Matrix Multiplication and Heap Data Structure

Covers the divide-and-conquer algorithm for matrix multiplication and introduces the (binary) heap data structure.

Heapsort and Priority Queues

Covers the Heapsort algorithm, which sorts arrays efficiently using max-heaps and introduces priority queues.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Heaps: Data Structure and Heapsort

Explores heaps, heapsort, and their efficiency in implementing priority queues.

Heapsort and Priority Queues

Explores heapsort, priority queues, and their operations, highlighting time complexity and practicality.

Sorting Algorithms: Sorting Methods and Comparison

Explores sorting methods, insertion sort, and algorithm comparison for efficient data organization.

Heaps and Heapsort

Covers heaps, heapsort, heap data structure, storage in arrays, and heap property maintenance.

Matrix-Matrix Multiplication: Algorithms and Applications

Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.

Solving Parity Games in Practice

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

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Dynamic Programming: Rod Cutting and Matrix Chain Multiplication

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

Analysis of Randomized Quick Sort

Analyzes the running time and comparisons in randomized quick sort, proving its efficiency and optimality in comparison sorting.

Complexity & Induction: Algorithms & Proofs

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

Sorting Algorithms: Selection and Insertion

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Derivatives, O-Notation

Explores derivatives, O-Notation, extrema, and algorithm complexity in Analysis 1.

Optimization Algorithms: Greedy Approach

Explores optimization problems and greedy algorithms for efficient decision-making.