6.856J/18.416J Randomized Algorithms

Lecture: 2:30-4 Monday, Wednesday, Friday in 66-168
Units: 5-0-7 G H-Level Grad Credit
Instructor: David Karger karger@mit.edu

Course Information

The course text is Randomized Algorithms (link includes errata list). Copies should be available at the Coop. You can also order online at Amazon or Barnes and Noble.

If you are thinking about taking this course, you might want to see what past students have said about previous times I taught randomized Algorithms, in 2007, 2005, or 2002, as well as its sibling course Advanced Algorithms.

Please register for the course by using this form.

You can send anonymous e-mail (praise, complaints, suggestions, ...) to the 6.856 staff by using this form.

Handouts

  1. Course Summary and Info
  2. Problem Set 1, due 2/9/11
  3. Problem Set 2, due 2/16/11
  4. Problem Set 3, due 3/2/11
  5. Problem Set 4, due 3/9/11
  6. Problem Set 1 solutions
  7. Problem Set 2 solution
  8. Problem Set 3 solution
  9. Problem Set 5, due 3/16/11
  10. Problem Set 6, due 3/30/11
  11. Problem Set 4 solution
  12. Problem Set 5 solution
  13. Problem Set 7, due 4/6/11
  14. Course Project Assignment, due 4/6/11
  15. Problem Set 8, due 4/18/11

Notes

These notes reflect a starting plan that may change. They are my own lecture notes; they will not serve to teach the material but should serve as a record of what was covered in each lecture. Note that all course notes can be found in nb, where you can read and annotate them with questions.