• Mark Braverman: Complexity theory, algorithms, game theory, machine learning, and applications of computer science in healthcare and medicine.

• Zeev Dvir: Complexity theory, derandomization, coding theory, algebraic combinatorics.
• Shiva Kintali: Computational Complexity, Algorithmic Game Theory, Graph Theory and Combinatorial Optimization.

• Mohammad Hossein Bateni (Moses Charikar)

• Moritz Hardt (Boaz Barak)
• Nadia Heninger (Bernard Chazelle)

• Mohammad Mahmoody-Ghidary (Boaz Barak)

• Omri Weinstein

• Wolfganga Mulzer (Bernard Chazelle)

• David Steurer (Sanjeev Arora)

• Shi Li (Moses Charikar)

• Huy Nguyen

• Yury Pritykin (Bernard Chazelle)
• Sushant Sachdeva (Sanjeev Arora)

• Anuradha Venugopalan

• Chris Beck

• Rong Ge (Sanjeev Arora)

• Huy Nguyen
• Manjish Pal

• Siyu Yang

• Sharon Goldberg (Boaz Barak)

• David Xiao (Boaz Barak)

• Russell Impagliazzo: proof complexity, the theory of cryptography, computational randomness, structural complexity, optimization heuristics.

• Loukas Georgiadis (Bob Tarjan)

• George Karakostas (Sanjeev Arora)

• Ding Liu (Bernard Chazelle)

• Mark McCann (Nick Pippenger)

• Kostas Tsioutsiouliklis (Bob Tarjan)
• Tassos Viglas (Dick Lipton)

• Nir Ailon (Bernard Chazelle)
• Bo Brinkman (Moses Charikar)
• Amit Chakrabarti (Bernard Chazelle)

• Miroslav Dudik (Rob Schapire)
• Edith Elkind (Amit Sahai)

• Elad Hazan (Sanjeev Arora)
• Satyen Kale (Sanjeev Arora)
• Adriana Karagiozova (Moses Charikar)

• Subhash Khot (Sanjeev Arora)

• Konstantin Makarychev (Moses Charikar)
• Yury Makarychev (Moses Charikar)

• Manoj Prabhakaran (Amit Sahai)

• Iannis Tourlakis (Sanjeev Arora)

• Renato Werneck (Bob Tarjan)
• Tony Wirth (Moses Charikar)
• Shengyu Zhang (Andy Yao)

• Bo Brinkman

• Ben Gum

• George Karakostas

• Iannis Tourlakis
• Kostas Tsioutsiouliklis

• Tony Wirth

• Rong Ge

• Shi Li

• Yury Pritykin
• Sushant Sachdeva

• Anuradha Venugopalan

• Amit Agarwal (Moses Charikar)

• Seshadhri Comandur (Bernard Chazelle)

• Aditya Bhaskara (Moses Charikar)

• Aravindan Vijayaragahvan (Moses Charikar)

• Eden Chlamtac (Sanjeev Arora)

• Subhash Khot
• Ding Liu

• Sina Jafarpour (Rob Schapire)

• Siddhartha Sen (Bob Tarjan)

• Mohammad Mahmoody-Ghidary (Boaz Barak)

• Mohammad Hossein Bateni (Moses Charikar)
• Aditya Bhaskara
• Eden Chlamtac (Sanjeev Arora)

• Sharon Goldberg (Boaz Barak)
• Moritz Hardt (Boaz Barak)
• Nadia Heninger (Bernard Chazelle)
• Sina Jafarpour
• Rajsekar Manokaran (Sanjeev Arora)
• Wolfganga Mulzer (Bernard Chazelle)
• David Steurer (Sanjeev Arora)
• Aravindan Vijayaragahvan

• Nir Ailon

• Miroslav Dudik
• Edith Elkind
• Loukas Georgiadis

• Elad Hazan
• Satyen Kale
• Adriana Karagiozova

• Konstantin Makarychev
• Yury Makarychev
• Mark McCann
• Manoj Prabhakaran

• Renato Werneck

• Shengyu Zhang

• Olga Troyanskaya: CS Dept. Bio-informatics, molecular biology.

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

IAS faculty and long-term visitors

Faculty IAS faculty Affiliated Faculty Students Recent Alumni

Theory group faculty

IAS faculty and long-term visitors [[#IAS]

(See the IAS CS/DM's groups page for a list of current members and visitors.)

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

• Alexander Razborov: Computational Complexity, proof complexity, combinatorics
• Avi Wigderson: Randomness and computation, algorithms and optimization, complexity theory, circuit complexity, proof complexity, quantum computation and communication, cryptography and distributed computation.

Affiliated faculty

• David Blei: CS Dept. Probabilistic graphical models and approximate posterior inference, topic models, information retrieval, and text processing, nonparametric Bayesian statistics.

• Kai Li: CS Dept. Systems, content-based search and visualization.

• Jeniffer Rexford: CS Dept. Internet routing, network measurement, and network management.

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

• [[ http://function.princeton.edu/ogt.html | Olga Troyanskaya]: CS Dept. Bio-informatics, molecular biology.

(under construction)

• David Dobkin: (Dean of the faculty) graphics, computational geometry.

• David Dobkin: Dean of the faculty,

• [[ http://www.cs.princeton.edu/~dpd/ | David Dobkin]: Dean of the faculty,

graphics, computational geometry.

Recent Alumni (partial list)

Affiliated faculty, neighbors and friends.

Faculty Affiliated Faculty IAS Members Students Recent Alumni

Faculty | Affiliated Faculty IAS Members Students Recent Alumni

Theory Group Faculty

Affiliated faculty, neighbors and friends.

2005-6 Theoretical CS/Discrete Math Members at IAS

Students

Recent Alumni (partial list)

Noga Alon (Combinatorics, Graph Theory and their applications in Theoretical Computer Science) spring term only Shiri Artstein (Asymptotic Geometric Analysis) Andrej Bogdanov (Computational Complexity) Alex Gamburd (Lie Groups, Discrete Mathematics) Yair Glasner (Lie Groups, Discrete Mathematics) James Lee (Theoretical Computer Science) Roy Meshulam (Combinatorics) Alexander Razborov (Computational Complexity, Proof Complexity, Combinatorics) Eyal Rozenman (Combinatorics) Michael Saks (Computational Complexity, Discrete Mathematics) Lior Silberman (Analysis on Locally Symmetric Spaces) Benny Sudakov (Combinatorics, Computer Science) Balazs Szegedy (Arithmetic Groups) Van Vu (Combinatorics) Andrzej Zuk (Analysis and Geometry on Groups)

Students

• Amit Agarwal (Moses Charikar)
• Nir Ailon (Bernard Chazelle)
• Paul Chang
• Eden Chlamtac
• Seshadhri Comandur (Bernard Chazelle)
• Miroslav Dudik (Rob Schapire)
• Edith Elkind (Amit Sahai)
• Loukas Georgiadis (Bob Tarjan)
• Elad Hazan (Sanjeev Arora)
• Satyen Kale (Sanjeev Arora)
• Adriana Karagiozova (Moses Charikar)
• Konstantin Makarychev (Moses Charikar)
• Yury Makarychev (Moses Charikar)
• Mark McCann (Nick Pippenger)
• Elena Nabieva (Mona Singh)
• Jason Perry
• Manoj Prabhakaran (Amit Sahai)
• (Sanjeev Arora)
• Renato Werneck (Bob Tarjan)
• David Xiao (Boaz Barak)
• Elena Zaslavsky (Mona Singh)
• Shengyu Zhang (Andy Yao)

Recent Alumni (partial list)

• Amit Chakrabarti
• Subhash Khot
• Ding Liu
• Yaoyun Shi
• Tassos Viglas

• Noga Alon IAS (spring terms only): Combinatorics, graph theory and their applications in theoretical computer science
• Maria Klawe: Dean of SEAS, Algorithms and data structures, discrete mathematics, interactive multimedia technologies in teaching mathematics, science and reading.
• 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.
• Richard Lipton: Prof Emeritus, now at GA-Tech. Complexity theory, computer architecture, and DNA-based computers
• Alexander Razborov: IAS. Computational Complexity, proof complexity, combinatorics
• 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.
• 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.
• Sergio Verdu: Dept. of EE. Information Theory, Data Compression and Statistical Signal Processing.
• Avi Wigderson:IAS. Randomness and computation, algorithms and optimization, complexity theory, circuit complexity, proof complexity, quantum computation and communication, cryptography and distributed computation.
• 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.

Noga Alon (Combinatorics, Graph Theory and their applications in Theoretical Computer Science) spring term only Shiri Artstein (Asymptotic Geometric Analysis) Andrej Bogdanov (Computational Complexity) Alex Gamburd (Lie Groups, Discrete Mathematics) Yair Glasner (Lie Groups, Discrete Mathematics) James Lee (Theoretical Computer Science) Roy Meshulam (Combinatorics) Alexander Razborov (Computational Complexity, Proof Complexity, Combinatorics) Eyal Rozenman (Combinatorics) Michael Saks (Computational Complexity, Discrete Mathematics) Lior Silberman (Analysis on Locally Symmetric Spaces) Benny Sudakov (Combinatorics, Computer Science) Balazs Szegedy (Arithmetic Groups) Van Vu (Combinatorics) Andrzej Zuk (Analysis and Geometry on Groups)

2005-6 Theoretical CS/Discrete Math Members at IAS

Noga Alon (Combinatorics, Graph Theory and their applications in Theoretical Computer Science) spring term only Shiri Artstein (Asymptotic Geometric Analysis) Andrej Bogdanov (Computational Complexity) Alex Gamburd (Lie Groups, Discrete Mathematics) Yair Glasner (Lie Groups, Discrete Mathematics) James Lee (Theoretical Computer Science) Roy Meshulam (Combinatorics) Alexander Razborov (Computational Complexity, Proof Complexity, Combinatorics) Eyal Rozenman (Combinatorics) Michael Saks (Computational Complexity, Discrete Mathematics) Lior Silberman (Analysis on Locally Symmetric Spaces) Benny Sudakov (Combinatorics, Computer Science) Balazs Szegedy (Arithmetic Groups) Van Vu (Combinatorics) Andrzej Zuk (Analysis and Geometry on Groups)

• Noga Alon IAS (spring terms only): Combinatorics, graph theory and their applications in theoretical computer science

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

• Maria Klawe: Dean of SEAS, Algorithms and data structures, discrete mathematics, interactive multimedia technologies in teaching mathematics, science and reading.

• Paul Seymour: Math Dept. Graph theory, particularly minors of graphs, and structural properties of graphs of use for algorithms; matroid theory; discrete optimization.

• Avi Wigderson:IAS. Randomness and computation, algorithms and optimization, complexity theory, circuit complexity, proof complexity, quantum computation and communication, cryptography and distributed computation.
• 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.

Affiliated faculty, neighbors and friends.

• Noga Alon IAS (spring terms only):

Combinatorics, graph theory and their applications in theoretical computer science

• Maria Klawe: Dean of SEAS,

Algorithms and data structures, discrete mathematics, interactive multimedia technologies in teaching mathematics, science and reading.

• 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.
• Richard Lipton: Prof Emeritus, now at GA-Tech. Complexity theory, computer architecture, and DNA-based computers
• Alexander Razborov: IAS. Computational Complexity, proof complexity, combinatorics
• 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.
• 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.

• Sergio Verdu: Dept. of EE. Information Theory, Data Compression and Statistical Signal Processing.
• Avi Wigderson:IAS. Randomness and computation, algorithms and optimization, complexity theory, circuit complexity, proof complexity, quantum computation and communication, cryptography

and distributed computation.

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

• Robert Sedgewick: Scientific analysis of algorithms, analytic combinatorics.
• Robert Schapire: Machine learning, learning theory, boosting, on-line learning
• 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.
• 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.

Theory Group Faculty

• Sanjeev Arora: Complexity theory, approximation algorithms for NP-hard problems, uses of randomness in computation, probabilistically checkable proofs.
• Boaz Barak: Foundations of cryptography, complexity theory, derandomization.
• 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.
• Nicholas Pippenger: Computational complexity theory, communication networks and switching, discrete mathematics, combinatorics and probability theory
• ? Scientific analysis of algorithms, analytic combinatorics.
• ? Machine learning, learning theory, boosting, on-line learning
• ? Physics of computation, tools for computer music, and computational economics. Currently working on how to do computing via particle interaction in a homogeneous medium.
• ? Algorithms, discrete optimization, network flows.
• ? Design and analysis of efficient computer algorithms, especially algorithms for problems that are combinatorial in nature.