Faculty IAS faculty Affiliated Faculty Students Recent Alumni
Theory group faculty
- Sanjeev Arora: Complexity theory, approximation algorithms for NP-hard problems, uses of randomness in computation, probabilistically checkable proofs.
- Mark Braverman: Complexity theory, algorithms, game theory, machine learning, and applications of computer science in healthcare and medicine.
- Moses Charikar: Design and analysis of algorithms, particularly approximation algorithms, online algorithms, and algorithms for large datasets.
- Bernard Chazelle: Design and analysis of algorithms, computational geometry, computational biology.
- Zeev Dvir: Complexity theory, derandomization, coding theory, algebraic combinatorics.
- Shiva Kintali: Computational Complexity, Algorithmic Game Theory, Graph Theory and Combinatorial Optimization.
- Robert Sedgewick: Scientific analysis of algorithms, analytic combinatorics.
- Robert Schapire: Machine learning, learning theory, boosting, on-line learning
- Kevin Wayne: Algorithms, discrete optimization, network flows.
- Robert Tarjan: Design and analysis of efficient computer algorithms, especially algorithms for problems that are combinatorial in nature.
IAS faculty and long-term visitors
(In addition to these, every year the IAS has many short-term and one-year
visitors, see the IAS CS/DM's groups page for a current list.)
- Noga Alon (spring terms only): Combinatorics, graph theory and their applications in theoretical computer science
- Russell Impagliazzo: proof complexity, the theory of cryptography, computational randomness, structural complexity, optimization heuristics.
- Avi Wigderson: Randomness and computation, algorithms and optimization, complexity theory, circuit complexity, proof complexity, quantum computation and communication, cryptography and distributed computation.
- David Blei: CS Dept. Probabilistic graphical models and approximate posterior inference, topic models, information retrieval, and text processing, nonparametric Bayesian statistics.
- David Dobkin: (Dean of the faculty) graphics, computational geometry.
- Andrea LaPaugh: CS Dept. Algorithms for information access for the Web and digital libraries. Efficient combinatorial algorithms for computer-aided design (CAD) of digital systems.
- Kai Li: CS Dept. Systems, content-based search and visualization.
- Richard Lipton: Prof Emeritus, now at GA-Tech. Complexity theory, computer architecture, and DNA-based computers
- Jeniffer Rexford: CS Dept. Internet routing, network measurement, and network management.
- Amit Sahai: UCLA. Cryptography, Computational Complexity.
- Paul Seymour: Math Dept. Graph theory, particularly minors of graphs, and structural properties of graphs of use for algorithms; matroid theory; discrete optimization.
- Mona Singh: CS Dept. Computational molecular biology.
- Ken Steiglitz: Physics of computation, tools for computer music, and computational economics. Currently working on how to do computing via particle interaction in a homogeneous medium.
- Benny Sudakov: Math Dept. Algebraic and probabilistic methods in combinatorics, Extremal graph and hypergraph theory, Ramsey theory, random graphs, application of combinatorics to theoretical computer science.
- Olga Troyanskaya: CS Dept. Bio-informatics, molecular biology.
- Sergio Verdu: Dept. of EE. Information Theory, Data Compression and Statistical Signal Processing.
- Andrew Yao: Prof Emeritus, now at Tsinghua University. Analysis of algorithms, communication complexity, computational complexity, development of complexity models for application areas such as pseudorandom number generation, also quantum computing and quantum cryptography.
Recent Alumni (partial list)