Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting
Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting
In this lecture, Professor Demaine continues with cache-oblivious algorithms, including their applications in searching ... Read more
3 Jan 2017
•
1hr 17mins
Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices
Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices
In this lecture, Professor Demaine introduces cache-oblivious algorithms.
3 Jan 2017
•
1hr 20mins
Similar Podcasts
Recitation 11: Cryptography: More Primitives
Recitation 11: Cryptography: More Primitives
In this recitation, problems related to cryptography are discussed.
3 Jan 2017
•
49mins
Lecture 22: Cryptography: Encryption
Lecture 22: Cryptography: Encryption
In this lecture, Professor Devadas continues with cryptography, introducing encryption methods.
3 Jan 2017
•
1hr 24mins
Lecture 21: Cryptography: Hash Functions
Lecture 21: Cryptography: Hash Functions
In this lecture, Professor Devadas covers the basics of cryptography, including desirable properties of cryptographic fu... Read more
3 Jan 2017
•
1hr 22mins
Recitation 10: Distributed Algorithms
Recitation 10: Distributed Algorithms
In this recitation, problems related to distributed algorithms are discussed.
3 Jan 2017
•
50mins
Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
In this lecture, Professor Lynch introduces asynchronous distributed algorithms.
3 Jan 2017
•
1hr 12mins
Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking
Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking
In this lecture, Professor Lynch introduces synchronous distributed algorithms.
3 Jan 2017
•
1hr 17mins
Recitation 9: Approximation Algorithms: Traveling Salesman Problem
Recitation 9: Approximation Algorithms: Traveling Salesman Problem
In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.
3 Jan 2017
•
31mins
Lecture 18: Complexity: Fixed-Parameter Algorithms
Lecture 18: Complexity: Fixed-Parameter Algorithms
In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms.
3 Jan 2017
•
1hr 17mins