Theory of Computing Group

The Theory of Computing Group currently includes four full-time faculty and numerous graduate students.  Current areas of interest include:

  • Algorithms, including approximation algorithms for combinatorial and stochastic optimization, algorithms in number theory, algebra, and biology;
  • Computational complexity, especially structural complexity and the role of randomness in computation;
  • Algorithmic game theory;
  • Emerging paradigms, especially quantum computing;
  • Cryptography;
  • Learning theory.

Research Group: 

Project Website: