Courses in Algorithms and Complexity


	Courses in Algorithms and Complexity at Carnegie Mellon

Graduate Courses

15-750: Algorithms Core. (Taught every Spring)
33-658: Quantum Computation and Quantum Information Theory. Bob Griffiths, David Collins, Frank Tabakin and Edward Gerjuoy, Spring 2002.
15-853: Algorithms in the Real World. Guy Blelloch and Bruce Maggs, Fall 2001. (Typically every 2nd year)
15-859(B): Machine Learning Theory. Avrim Blum, Spring 2002
15-855: Complexity Theory. Steven Rudich, Fall 2000. (Typically every 2nd year)
15-859: Mathematical Games. Daniel Sleator, Alan Frieze, Fall 2001. (new course)
15-859: Computational Geometry. Gary Miller, Fall 2001. (new course)
15-859B: Introduction to Scientific Computing. Paul Heckbert, Fall 2001. (Typically every 2nd year)
Other courses taught from time to time:
- Approximation and On-Line Algorithms
- 21-801: Sampling, Counting and Rapidly Mixing Markov Chains. Alan Frieze and Martin Dyer, Spring 2001. (new course)
- 47-863: Computational Biology. R. Ravi, Spring 2001 mini 4 (new course).
- Algorithms for Indexing and Searching
- Randomized Algorithms
- Parallel Computing
- Information Theory
See also the CMU Algorithms and Complexity Group web page.
03-711 Computational Genomics and Molecular Biology. Dannie Durand, Fall 2001

Other Courses of Interest

Undergraduate Courses

15-451: Algorithms. (Taught every semester)
15-453: Formal Languages, Automata, and Computability Theory (Taught every Spring)
15-251 (was 15-299): Mathematical Foundations of Computer Science. (Taught every Spring)

Last modified: November 2001