Instructors

dr_gandhi

PACT is run by Professor Rajiv Gandhi, Professor of Computer Science at Rutgers University-Camden. He also teaches part-time at the University of Pennsylvania. He received his Ph.D. in Computer Science from the University of Maryland in 2003. He also worked as a software engineer at Qualcomm from 1994-96.

His research interests are Algorithm Design, Combinatorial Optimization, and Probabilistic methods. He is a passionate educator and has worked with students with varied backgrounds, and he received the Provost’s Award for Teaching Excellence at Rutgers–Camden in 2006. He received a Fulbright fellowship to teach in Mumbai, India from Jan-May 2011.

In 2009, Professor Gandhi gave a lecture to a group of students at the Cherry Hill East high school and volunteered to teach a group of students topics in Discrete Mathematics during Saturdays over the course of the school year 2009-2010. He then continued to work with these students over the summer of 2010. In summer 2011, he worked with the Center for Computational Intractability to hold a similar program on the Princeton campus, and this program was repeated in the summer of 2012. Thus PACT was born.

Professor Gandhi has given an inspirational TEDx Talk in 2016 called “From Potential To Promise: Developing scholars, one eureka moment at a time” which can be found below.

Guest Lecturers

Students in the program also get the exciting opportunity to learn from guest lecturers! Read on to see which lecturers have made great presentations for PACT students.

2020 2019 2018 2017 2016 2015 2014 2013 2012 2011

Summer 2020

Milind Prabhu

Undergraduate

Department of Computer Science and Engineering

Indian Institute of Technology, Guwahati

Sublinear and Streaming Algorithms

Nirmit Joshi

Undergraduate

Department of Computer Technology

Veermata Jijabai Technological Institute

Theoretical Machine Learning

Vihan Shah

Grad Student

Department of Computer Science

Rutgers University

Sublinear and Streaming Algorithms

Shreyas Pai

PhD Student

Department of Computer Science

The University of Iowa

Distributed Algorithms, Communication Complexity, Combinatorial Optimization, and Algorithmic Game Theory

Samir Khuller

Peter and Adrienne Barris Chair of Computer Science

Professor of Computer Science

Department of Computer Science

Northwestern University

Algorithm design, Combinatorial optimization, Graph theory, Parallel computation

David Williamson

Professor of Operations Research and Information Engineering

School of Operations Research and Information Engineering

Cornell University

Combinatorial Optimization, Approximation Algorithms

Sanjeev Khanna

Henry Salvatori Professor of Computer and Information Science

Department of Computer & Information Science

University of Pennsylvania

Combinatorial Optimization and Complexity Theory

David Shmoys

Laibe/Acheson Professor of Business Management & Leadership Studies

School of Operations Research and Information Engineering

Cornell University

Discrete Optimization

Chandra Chekuri

Paul and Cynthia Saylor Professor

Department of Computer Science

University of Illinois, Urbana-Champaign

Discrete and Combinatorial Optimization, Approximation Algorithms, Mathematical Programming, Algorithmic Applications

Sanjay Subramanian

Predoctoral Young Investigator

Allen Institute for Artificial Intelligence

Natural Language Understanding and Machine Learning

Ben Edelman

PhD student

Theory of Computation

ML Theory

Harvard University

Algorithms, Learning, and Strategic Behavior

Sepehr Assadi

Assistant Professor

Postdoc

Computer Science Department

Rutgers University

Theoretical foundations of big data analysis

Summer 2019

Nishita Jain

Undergraduate

University of Pennsylvania

Lovász Local Lemma

Glenn Sun

Undergraduate

University of California, Los Angeles

Matrix Multiplication Verification, Polynomial Multiplication Verification, Polynomial Identity Verification, Complexity Classes for Randomized Algorithms

Jakob Degen

Undergraduate

Rutgers University

Communication Complexity

Anindya De

Professor

University of Pennsylvania

Voting Theory, Fourier Analysis of Boolean Functions

William Brown

PhD Student

Columbia University

Differential Privacy

Aaron Bernstein

Assistant Professor

Rutgers University

Spanners

Jelani Nelson

Professor

University of California, Berkeley

Streaming Algorithms

Ben Edelman

PhD Student

Harvard University

Sensitivity Conjecture

Sanjeev Khanna

Henry Salvatori Professor

University of Pennsylvania

Markov Chains and Random Walks

Chandra Chekuri

Professor

University of Illinois, Urbana-Champaign

Packing and Covering Problems, Randomized Rounding

David Williamson

Professor

Cornell University

Minimum Cut, Multiplicative Weights, EkSAT, and Maximum Cut

Matt Weinberg

Assistant Professor

Princeton University

Job Scheduling on Unrelated Machines

Ezra Edelman

Undergraduate

Princeton University

IP and ♯P Complexity Classes, ♯SAT

Sepehr Assadi

Postdoc

Princeton University

Sublinear Algorithms for Graph Coloring

Joel Spencer

Silver Professor

New York University

Unicyclic Graphs and Algorithmic Lovász Local Lemma

Keaton Naff

PhD Student

Columbia University

Optimal Transport Problem

Margaret Li

Research Engineer, Facebook AI Research

Facebook AI Research

Reinforcement Learning

Alex Lin

Research Engineer, ASAPP

Harvard University

Machine Learning

Summer 2018

David Williamson

Professor

Cornell University

Submodular Function Maximization, TSP, Max-SAT, and Max-Cut

Ben Edelman

PhD Student

Harvard University

Tree Metrics

Sepehr Assadi

PhD Student

University of Pennsylvania

Communication Complexity

Matt Weinberg

Assistant Professor

Princeton University

Prophet Inequalities

Sanjeev Khanna

Henry Salvatori Professor

University of Pennsylvania

Edge Disjoint Paths

Zeev Dvir

Assistant Professor

Princeton University

Private Information Retrieval

Pravesh Kothari

Research Instructor

Princeton University

Quantum Computing

Arvind Narayanan

Associate Professor

Princeton University

Modern Cryptography

Prathamesh Patil

PhD Student

University of Pennsylvania

Secretary Problems

Nishita Jain

Undergraduate

University of Pennsylvania

Blockchain

Summer 2017

Hrishikesh Khandeparkar

Undergraduate

Princeton University

High Dimensional Geometry and the Multiplicative Weights Method

Margaret Li

Software Engineer, Facebook

University of Pennsylvania

Zero-Knowledge Proofs

Sanjeev Khanna

Henry Salvatori Professor

Computer and Information Science

University of Pennsylvania

Random Walks, LP-rounding

Ben Edelman

Undergraduate

Princeton University

Introduction to Coding Theory, Tree Metrics

Shreyas Pai

Graduate Student

University of Iowa

Distributed Algorithms (MIS and 3-Coloring Directed Rooted Trees)

Sriram Pemmaraju

Professor

University of Iowa

Graph Sketches

Summer 2016

Ricson Cheng

Undergraduate

Carnegie Mellon University

Reconciliation Clustering

Hoon Oh

Undergraduate

Rutgers University

Algorithmic Game Theory

Sanjeev Khanna

Henry Salvatori Professor

Computer and Information Science

University of Pennsylvania

Fingerprinting and Sublinear Algorithms

Sampath Kannan

Professor

University of Pennsylvania

Turing Machines

Sanjeev Arora

Charles C. Fitzmorris Professor

Department of Computer Science

Princeton University

Decision Theory

Olenka Jain

Undergraduate

Harvard University

PTAS For Scheduling with Parallel Machines

Hrishikesh Khandeparkar

Undergraduate

Princeton University

Fibonacci Heaps

Ben Edelman

Undergraduate

Princeton University

Tree Metrics

Alex Lin

Undergraduate

Harvard University

Local Search Algorithms

Summer 2015

David Jacobowitz

Undergraduate

Princeton University

Mathematics and Computer Science: Revolutionizing Biology and Medicine

Varun Prabhakar

Undergraduate

University of Pennsylvania

The Probabilistic Method

Samir Khuller

Professor and Elizabeth Iribe Chair

School of Computer Science

University of Maryland

Scheduling

Po-Ling Loh

Assistant Professor of Statistics

Department of Statistics

Wharton School

University of Pennsylvania

Graphical Models

Sanjeev Arora

Charles C. Fitzmorris Professor

Department of Computer Science

Princeton University

Semantic Vectors

Alex Lin

Undergraduate

Harvard University

Steiner Tree-Related Problems, Local Search Algorithms, Polynomial-Time Approximation Schemes

Ben Edelman

Undergraduate

Princeton University

Tree Metrics

Summer 2014

David Jacobowitz

Undergraduate

Princeton University

Mathematics and Computer Science: Revolutionizing Biology and Medicine

Sanjeev Khanna

Henry Salvatori Professor

Computer and Information Science

University of Pennsylvania

Fingerprinting and PCP Theorem

Michael Saks

Professor

Department of Mathematics

Rutgers University

Coloring Planar Graphs

Zhongxia (Ricky) Zhao

Undergraduate

Princeton University

Game Theory

Summer 2013

Summer 2012

Summer 2011

Sanjeev Arora

Charles C. Fitzmorris Professor

Department of Computer Science

Princeton University

A Polynomial Time Approximation Scheme for the Euclidean Traveling Salesperson Problem

Bernard Chazelle

Eugene Higgins Professor

Director of the Center for Computational Intractability

Department of Computer Science

Princeton University

Computational Geometry

Subhash Khot

Associate Professor

Department of Computer Science

Courant Institute of Mathematical Sciences

New York University

Hardness of Approximation Results and the PCP Theorem

Ofer Neiman

Research Associate

Department of Computer Science

Princeton University

Metric Embeddings for Graphs

Ajay Roopakalu

Student

Department of Computer Science

Princeton University

Quantum Computation and Semidefinite Programming

Robert E. Tarjan

James S. McDonnell Distinguished University Professor

Senior HP Fellow

Department of Computer Science

Princeton University

Algorithms for MST and Shortest Path in a Graph