6.046J Design and Analysis of Algorithms
6.046J Design and Analysis of Algorithms (Spring 2015, MIT OCW). Instructors: Prof. Erik Demaine, Prof. Srinivas Devadas, and Prof. Nancy Lynch. This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography. (from ocw.mit.edu)
|Lecture 20 - Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees|
Instructor: Nancy Ann Lynch. In this lecture, Professor Lynch introduces asynchronous distributed algorithms.
Go to the Course Home or watch other lectures: