Skip to main content

Search

Show all results for

Home

Lecture

Matrix Multiplication and Heap Data Structure

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Description

This lecture covers the divide-and-conquer algorithm for matrix multiplication, including pseudocode, analysis, and Strassen's method. It also introduces the (binary) heap data structure, explaining its properties and storage methods.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

https://mediaspace.epfl.ch/media/0_thga2zu4

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

DEMO: est et minim

Culpa Lorem in consectetur occaecat. Labore adipisicing cupidatat fugiat nulla non culpa pariatur sunt nisi adipisicing aute anim nostrud excepteur. Minim incididunt sit commodo nulla do duis consequat dolore nulla aliqua fugiat voluptate tempor.

Instructors (3)

incididunt ipsum consequat do

Aliquip sint qui irure aute consequat consequat sit excepteur esse tempor. Eu id est non magna fugiat ea. Consectetur deserunt in id ad non mollit. Dolor amet sunt consequat qui veniam mollit sunt ad proident. Sit tempor ullamco aute culpa. Ut qui elit dolore labore esse.

eiusmod fugiat ea

Irure qui irure laborum et exercitation nostrud pariatur Lorem esse adipisicing nulla veniam dolor adipisicing. Cillum Lorem pariatur veniam cillum do pariatur commodo sunt irure amet nisi aute nisi. Laborum id ex velit sunt dolore anim laborum. Sint est ex nisi ullamco aute duis sit laborum esse irure sit esse. Irure labore reprehenderit ullamco proident aliqua. Proident ea sunt aute commodo.

aliquip eu quis

Enim enim id duis duis ut labore et nisi id anim ad. Aute in et commodo veniam. Officia ullamco magna qui consequat occaecat enim sit ullamco. Enim magna eiusmod voluptate voluptate aute. Do proident reprehenderit adipisicing fugiat cillum magna aliqua excepteur occaecat irure.

Related lectures (30)

Matrix Multiplication and Divide-and-Conquer Techniques

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

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.

Heaps and Priority Queues

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

Heaps: Data Structure and Heapsort

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