Understanding the power and limitations of algorithms is a basic and deep problem in computer science. Furthermore, algorithmic processes give us a new language for science as well as social science. Such study is crucial for further progress in natural science and social sciences. This project assembles a team of investigators with diverse interests, with the goal of launching a concerted, thorough attack on the fundamental problems of computational intractability.
Director |
|
Executive Committee |
Other Members |
A major goal of our project is to create a multidisciplinary environment for our many postdocs, where they will be exposed to a diverse set of tools and modes of thinking which they can bring to bear on their own research problems. We are particularly proud of what our postdocs have gone on to accomplish:
Postdocs:
IAS : Jing Chen, Andy Drucker, Klim Efremenko, Or Meir, Ankur Moitra, Jelani Nelson
Princeton : Ravishankar Krishnaswamy, Ali Kemal Sinop, Ilya Volkovich
Rutgers : Raghu Meka
Alumni:
IAS : Swastik Kopparty (Rutgers), Shachar Lovett (UCSD), Srikanth Srinivasan (IIT Bombay), Shubhangi Saraf (Rutgers)
Princeton : Alex Andoni (MSR Silicon Valley), Arnab Bhattacharyya (DIMACS/Rutgers), Matei David, Pavel Hrubes (U. Calgary), Ofer Neiman (Ben-Gurion), Ricky Rosen, Grant Schoenebeck (U. Michigan)
Princeton/IAS : Zeev Dvir (Princeton), Dana Moshkovitz (MIT), Anup Rao (U. Washington), Guy Rothblum (MSR Silicon Valley), Nikhil Srivastava (MSR India), Madhur Tulsiani (TTI)
Rutgers : Gabor Kun
Visitors (Past and Present):
Ran Raz (Fall '12), David Zuckerman (Fall '11-Spring '12), Noga Alon (Fall '11), Ryan O'Donnell (Fall '10-Spring '11)
Administrative Staff:
Mitra Kelly
323 Computer Science, Princeton University
mkelly
 |