Claim OwnershipDesign and Analysis of Algorithms (2015)
Subscribed: 47Played: 108
Subscribe
© http://ocw.mit.edu; Creative Commons Attribution-NonCommercial-ShareAlike 4.0; http://ocw.mit.edu/terms; Album art photo courtesy of Srinivas Devadas.
Description
6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms.
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
39 Episodes
Reverse
In this lecture, Professor Demaine continues with cache-oblivious algorithms, including their applications in searching and sorting.
In this lecture, Professor Demaine introduces cache-oblivious algorithms.
In this recitation, problems related to cryptography are discussed.
In this lecture, Professor Devadas continues with cryptography, introducing encryption methods.
In this lecture, Professor Devadas covers the basics of cryptography, including desirable properties of cryptographic functions, and their applications to security.
In this recitation, problems related to distributed algorithms are discussed.
In this lecture, Professor Lynch introduces asynchronous distributed algorithms.
In this lecture, Professor Lynch introduces synchronous distributed algorithms.
In this recitation, problems related to approximation algorithms are discussed, namely the traveling salesman problem.
In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms.
In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems.
In this recitation, problems related to NP-Completeness are discussed.
In this lecture, Professor Demaine introduces NP-completeness.
In this lecture, Professor Devadas introduces linear programming.
In this recitation, problems related to Network Flow and Matching are discussed.
In this lecture, Professor Devadas continues with the topic of network flow.
In this lecture, Professor Devadas introduces network flow, and the Max Flow, Min Cut algorithm.
In this recitation, problems related to greedy algorithms are discussed.
In this lecture, Professor Demaine introduces greedy algorithms, which make locally-best choices without regards to the future.
In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem.
Comments
Download from Google Play
Download from App Store
United States