Design and Analysis of Algorithms (MIT 6.046J) - Video lectures 2015
Erik Demaine and Srini Devadas and Nancy Lynch

@article{,
title= {Design and Analysis of Algorithms (MIT 6.046J) - Video lectures 2015},
journal= {},
author= {Erik Demaine and Srini Devadas and Nancy Lynch},
year= {2015},
url= {https://ocw.mit.edu/6-046JS15},
abstract= {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.

**Main course URL:** https://ocw.mit.edu/6-046JS15

**Table of contents:**

* Lecture 1: Overview, Interval Scheduling
* Lecture 2: Divide & Conquer: Convex Hull, Median Finding
* Lecture 3: Divide & Conquer: FFT
* Lecture 4: Divide & Conquer: van Emde Boas Trees
* Lecture 5: Amortization: Amortized Analysis
* Lecture 6: Randomization: Matrix Multiply, Quicksort
* Lecture 7: Randomization: Skip Lists
* Lecture 8: Randomization: Universal & Perfect Hashing
* Lecture 9: Augmentation: Range Trees
* Lecture 10: Dynamic Programming: Advanced DP
* Lecture 11: Dynamic Programming: All-Pairs Shortest Paths
* Lecture 12: Greedy Algorithms: Minimum Spanning Tree
* Lecture 13: Incremental Improvement: Max Flow, Min Cut
* Lecture 14: Incremental Improvement: Matching
* Lecture 15: Linear Programming: LP, reductions, Simplex
* Lecture 16: Complexity: P, NP, NP-completeness, Reductions
* Lecture 17: Complexity: Approximation Algorithms
* Lecture 18: Complexity: Fixed-Parameter Algorithms
* Lecture 19: Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees
* Lecture 20: Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees
* Lecture 21: Cryptography: Hash Functions
* Lecture 22: Cryptography: Encryption
* Lecture 23: Cache-Oblivious Algorithms: Medians & Matrices
* Lecture 24: Cache-Oblivious Algorithms: Searching & Sorting

This content hosted at the Internet Archive at https://archive.org/details/MIT6.046JS15
Files may have changed, which prevents torrents from downloading correctly or completely; please check for an updated torrent at https://archive.org/download/MIT6.046JS15/MIT6.046JS15_archive.torrent
Note: retrieval usually requires a client that supports webseeding (GetRight style).
Note: many Internet Archive torrents contain a 'pad file' directory. This directory and the files within it may be erased once retrieval completes.
Note: the file MIT6.046JS15_meta.xml contains metadata about this torrent's contents.},
keywords= {Computer Science, Programming, algorithms, computer engineering},
terms= {https://ocw.mit.edu/terms},
license= {http://creativecommons.org/licenses/by-nc-sa/3.0/},
superseded= {}
}