Theory
Papadimitriou and Chen's influential papers settled the complexity of computing a Nash equilibrium.
Interview with Xi Chen, whose new book (coauthored with Jin-Yi Cai) gives a thorough introduction to complexity dichotomies of counting problems by summarizing major results contributing to progress in field.
About
The group does research on the fundamental capabilities and limitations of efficient computation.
In addition, they use computation as a lens to gain deeper insights into problems from the natural, social, and engineering sciences.
The group is highly collaborative, both within Columbia and among peer institutions. They hold a weekly Theory Lunch and a bi-weekly Student Seminar. Most graduate students have (at least) two advisors and collaborate with several professors and other students. Some of the faculty are cross-listed with the IEOR department and the Data Science Institute.
Theory of Computing Group 
Add to GMail