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.
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.
Rutgers: Hao Huang
Alex Andoni (MSR Silicon Valley), Arnab Bhattacharyya, Jing Chen, Matei David, Zeev Dvir (Princeton), Klim Efremenko (U. Chicago, Simons Fellow), Pavel Hrubes (U. Washington), Swastik Kopparty (Rutgers), Gabor Kun, Shachar Lovett (UCSD), Raghu Meka (MSR Silicon Valley), Ankur Moitra (MIT), Dana Moshkovitz (MIT), Ofer Neiman (Ben-Gurion), Jelani Nelson (Harvard), Anup Rao (U. Washington), Ricky Rosen, Guy Rothblum (MSR Silicon Valley), Shubhangi Saraf (Rutgers), Grant Schoenebeck (U. Michigan), Srikanth Srinivasan (IIT Bombay), Nikhil Srivastava (MSR India), Madhur Tulsiani (TTI)
Visitors (Past and Present):
323 Computer Science, Princeton University