Lectures related to Matrix Multiplication and Divide-and-Conquer Techniques

Matrix Multiplication and Heaps: Efficient Algorithms

Discusses Strassen's algorithm for matrix multiplication and heaps, covering efficient algorithms and their applications 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.

Algorithms in Computer Science: Search and Sort Techniques

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

Heaps and Priority Queues

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

Matrix Multiplication and Heap Data Structure

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

Dynamic Programming: Rod Cutting and Matrix Chain Multiplication

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

Introduction to Algorithms: Course Overview and Basics

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

Matrix-Matrix Multiplication: Algorithms and Applications

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

Sorting Algorithms: Sorting Methods and Comparison

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

Algorithm Design: Divide and Conquer

Covers recursion, dynamic programming, and algorithm design using divide and conquer strategies.

Heaps: Data Structure and Heapsort

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

Heapsort and Priority Queues

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

Linear Algebra: Matrices Properties

Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.

Complexity & Induction: Algorithms & Proofs

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

Solving Parity Games in Practice

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

Heaps and Heapsort

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

Derivatives, O-Notation

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

Heapsort and Priority Queues

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

Merge Sort: Sorting Algorithm

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