My classes:

• 6.046/18.410 Introduction to Algorithms (Goldwasser & Maggs) -home page-
• 6.838 (G) Computational Geometry (Indyk & Teller) -home page-
• 6.840/18.404 (G) Theory of Computation (Sipser) -home page-
• 6.841/18.405 (G) Advanced Complexity Theory (Spielman) -home page-
• 6.852/18.437 (G) Distributed Algorithms (Lynch) -home page-
• 6.854/18.415 (G) Advanced Algorithms (Karger) -home page-
• 6.856/18.416 (G) Randomized Algorithms (Karger) -home page-
• 6.857 Network and Computer Security (Rivest) -home page-
• 6.891 (G) Approximation Algorithms (Williamson) -home page-
• 6.897 (G) Complexity Seminar (Sudan)
• 6.897 (G) Coding Theory (Sudan) -home page-
• 6.978 (G) Algorithmic Aspects of Embeddings (Indyk) -home page-
• 15.099 (G) Special Seminar in Operations Research - Discrete Optimization (Schulz) -home page-
• 18.100b Analysis I
• 18.314 Combinatorial Analysis (Fomin)
• 18.409 (G) The Probabilistic Method (Spencer) -home page-
• 18.417 (G) Computational Molecular Biology (Clote) -home page-
• 18.433 Combinatorial Optimizations (Vempala) -home page-
• 18.701 Abstract Algebra I (Artin)
• CS 225 (G) Pseudorandomness (Vadhan) -home page-

Relevant non-credit seminars:

• 18.419 (G) An Eye for Elegance - seminar on papers by Lovasz_(Vempala) -home page-
• 18.409 (G) The Behavior of Algorithms in Practice (Spielman) -home page-
• 18.419 (G) Random Walks and Polynomial-Time Algorithms (Vempala) -home page-
• Algorithms seminars

G - grad level course