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.

2018
2017
2016
2015
2014
2013
2012
2011

Summer 2018 – List: work in progress

David Williamson Professor Cornell University Submodular Function Maximization, TSP, Max-SAT, and Max-Cut

Ben Edelman Doctoral 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

Summer 2017

Hrishikesh Khandeparkar Undergraduate Princeton University High Dimensional Geometry and the Multiplicative Weights Method

Matt Weinberg Assistant Professor Princeton University Department of Computer Science Secretary Problems

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

Aravind Srinivasan Professor Department of Computer Science University of Maryland, College Park Lovász Local Lemma

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)

Viswanath Nagarajan Assistant Professor University of Michigan Industrial & Operations Engineering Department Stochastic Optimizations

Sriram Pemmaraju Professor University of Iowa Graph Sketches

Summer 2016

David Williamson Professor School of Operations Research and Information Engineering Department of Information Science Cornell University The Design of Approximation Algorithms Submodular Maximization

Zeev Dvir Assistant Professor Department of Computer Science Department of Mathematics Princeton University Incidence Theorems

Lisa Zhang Researcher Mathematics of Networks and Systems Research Department Minimum Inconsistency

Ricson Cheng Undergraduate Carnegie Mellon University Reconciliation Clustering

Arvind Narayanan Assistant Professor Department of Computer Science Princeton University Cryptography

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

Daniel Hsu Assistant Professor Department of Computer Science Data Science Institute Columbia University High Dimensional Geometry

Yingyu Liang PostDoc Fellow Department of Computer Science Princeton University Clustering

David Williamson Professor School of Operations Research and Information Engineering Department of Information Science Cornell University The Design of Approximation Algorithms Submodular Maximization

Pranjal Awasthi PostDoc Fellow Department of Computer Science Princeton University Machine Learning

Aaditya Ramdas PostDoc Fellow Department of Computer Science University of California, Berkeley Singular Value Decomposition

David Jacobowitz Undergraduate Princeton University Mathematics and Computer Science: Revolutionizing Biology and Medicine

Varun Prabhakar Undergraduate University of Pennsylvania The Probabilistic Method

Rakesh Vohra George A. Weiss and Lydia Bravo Weiss University Professor Department of Electrical and Systems Engineering Department of Computer and Information Science University of Pennsylvania Linear Programming

Samir Khuller Professor and Elizabeth Iribe Chair School of Computer Science University of Maryland Scheduling

Michael Dinitz Assistant Professor Department of Computer Science Johns Hopkins University Spanners

Po-Ling Loh Assistant Professor of Statistics Department of Statistics Wharton School University of Pennsylvania Graphical Models

Samory Kpotufe Assistant Professor Operations Research & Financial Engineering Princeton University Fast Search Algorithms

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

Mark Braverman Assistant Professor Program in Applied and Computational Mathematics Department of Computer Science Princeton University Interactive Proofs

Zeev Dvir Assistant Professor Department of Computer Science Department of Mathematics Princeton University Incidence Theorems

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

Aravind Srinivasan Professor Department of Computer Science Institute for Advanced Computer Studies Applied Mathematics & Statistics, and Scientific Computation Program University of Maryland, College Park Lovász Local Lemma

Zhongxia (Ricky) Zhao Undergraduate Princeton University Game Theory

Summer 2013

Emmanuel Abbe Assistant Professor Program in Applied and Computational Mathematics Department of Electrical Engineering Princeton University Coding Theory

Eric Allender Distinguished Professor Department of Computer Science Rutgers University Complexity and Randomness

Amey Bhangale Ph.D. Student Department of Computer Science Rutgers University Arithmetic Circuit Complexity

Mark Braverman Assistant Professor Program in Applied and Computational Mathematics Department of Computer Science Princeton University Probabilistic Method

Zeev Dvir Assistant Professor Department of Computer Science Department of Mathematics Princeton University Cryptography

Samir Khuller Professor and Chair School of Computer Science University of Maryland Primal-Dual Algorithms for Vertex Cover

David Williamson Professor School of Operations Research and Information Engineering Department of Information Science Cornell University The Design of Approximation Algorithms Advanced Topics in Approximation Algorithms

Summer 2012

Monica Babes-Vroman Ph.D Student Department of Computer Science Rutgers University Huffman Encoding

Arnab Bhattacharyya Post-Doctorate Department of Computer Science Princeton University Sub-Linear Algorithms

Mark Braverman Assistant Professor Department of Computer Science Princeton University Probabilistic Method

Zeev Dvir Assistant Professor Department of Computer Science Department of Mathematics Princeton University Incidence Theorems

Swastik Kopparty Professor Department of Mathematics Department of Computer Science Rutgers University Secure Multiparty Computation and Secret Sharing

Shachar Lovett Member School of Mathematics Institute for Advanced Study Coding Theory

Ankur Moitra Member School of Mathematics Institute for Advanced Study Zero-Sum Games in Combinatorial Optimization

Michael Saks Professor Department of Mathematics Rutgers University Coloring Planar Graphs

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

Moses Charikar Professor Department of Computer Science Princeton University Streaming Algorithms

Bernard Chazelle Eugene Higgins Professor Director of the Center for Computational Intractibility Department of Computer Science Princeton University Computational Geometry

Zeev Dvir Assistant Professor Department of Computer Science Department of Mathematics Princeton University Cryptography

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

Nikhil Srivastava Member School of Mathematics Institute for Advanced Study Spanners in Graphs

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