Courses in Algorithms and Complexity at CMU

Graduate Courses

• 15-750: Algorithms Core. (Taught every Spring)

• 33-658: Quantum Computation and Quantum Information Theory.
  Bob Griffiths and Avrim Blum, Spring 2001. (new course)

  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).

  15-853: Algorithms in the Real World.

  Guy Blelloch and Bruce Maggs, Fall 2000. (Typically every 2nd year)

  15-855: Complexity Theory.

  Steven Rudich, Fall 2000. (Typically every 2nd year)

  15-859B: Introduction to Scientific Computing.

  Paul Heckbert, Fall 2000. (Typically every 2nd year)

  Other courses taught from time to time:

  • Approximation and On-Line Algorithms
  • Algorithms for Indexing and Searching
  • Randomized Algorithms
  • Machine Learning Theory
  • Parallel Computing
  • Information Theory

  See also the CMU Algorithms and Complexity Group web page.

Other Courses of Interest

• 21-690: Methods of Optimization. (Given every Fall)

• 21-701: Discrete Mathematics. (Given every Fall)

• 47-835: Graph Theory. (Mini 1).

• 47-836: Networks and Matchings. (Mini 2).

• 47-856: Theory and algorithms for Linear Programming. (Mini 2).

• 47-830: Integer Programming. (Mini 3).

• 47-831: Advanced Integer Programming. (Mini 4).

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)