6.5210/18.415: Advanced Algorithms
This course is designed to be a capstone in algorithms that surveys some of the most powerful algorithmic techniques and key computational models. We will cover a broad selection of topics including amortization, hashing, dimensionality reduction, bit scaling, network flow, linear programming, and approximation algorithms. Domains that we will explore include data structures; algorithmic graph theory; streaming algorithms; online algorithms; parallel algorithms; computational geometry; external memory/cache oblivious algorithms; and continuous optimization.
For more details, see the course information.
Announcements
- By popular request we have made a Piazza for this course. It is for logistical questions only, please ask homework questions on NB. Sign up for Piazza here.
- If you intend to take this course please fill out this survey. Note that this form does NOT replace official registration via MIT Registrar’s office, it’s for our own internal bookkeeping.
- We will be using NB, a tool that permits students to discuss and ask questions about lecture videos, notes, and problems sets. Once you’ve been added to NB by an instructor (we’re doing it manually as survey submissions come in) go to the NB login page and use your email to reset your password.
- We’ve added this class to psetpartners, which you can use to find collaborators and comply with the collaboration policy which limits the number of psets you can work on with any individual collaborator.