Courses
In 2010-2011, besides our usual assortment of courses in Algorithms, Complexity, Computability and Discrete Mathematics, we will be offering the following more specialized courses:
- Geometric Complexity Theory by Ketan Mulmuley (Autumn)
- Computational Geometry by Tasos Sidiropoulos (Autumn)
- Quantum Computing by Alexander Razborov (Winter)
- Algorithms in Finite Groups by Laszlo Babai (Spring)
Students-only reading group
(please contact directly the organizer of a particular quarter if you are interested)
- Classics of Theory (Spring 2009; Joshua Grochow)
- Approximation algorithms and inapproximability (Autumn 2009 - Winter 2010; Parinya Chalermsook and Paolo Codenotti)
- Fourier analysis and its application in complexity (Spring 2010; Raghav Kulkarni)
Some theory-related courses offered in recent years
- Propositional Proof Complexity by Alexander Razborov
- Foundations of Computer Science by Janos Simon
- Markov Chain Monte Carlo Methods by Eric Vigoda
- Complexity Theory by Lance Fortnow
- Computational Geometry by Ketan Mulmuley
- Introduction to Artificial Intelligence by Partha Niyogi
- Algorithms by Laszlo Babai
- Random Algorithms by Eric Vigoda
- Computability and Complexity Theory by Robert Soare
- Machine Learning by Partha Niyogi
- Combinatorics by Laszlo Babai
- Parallel Algorithms by Ketan Mulmuley
- Advanced Algorithms by Eric Vigoda
- Algorithms in Finite Groups by Laszlo Babai
- Theory of Bioinformatics by Stuart Kurtz and Janos Simon
- Combinatorics and Complexity in Game Theory by Lance Fortnow and Caroline Klivans