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.

2019

2018

2017

2016

2015

2014

2013

2012

2011

**Summer 2019**

Nishita JainUndergraduateUniversity of Pennsylvania Lovász Local Lemma |

Glenn SunUndergraduateUniversity of California, Los Angeles Matrix Multiplication Verification, Polynomial Multiplication Verification, Polynomial Identity Verification, Complexity Classes for Randomized Algorithms |

Jakob DegenUndergraduateRutgers University Communication Complexity |

Anindya DeProfessorUniversity of Pennsylvania Voting Theory, Fourier Analysis of Boolean Functions |

William BrownPhD StudentColumbia University Differential Privacy |

Aaron BernsteinAssistant ProfessorRutgers University Spanners |

Jelani NelsonProfessorUniversity of California, Berkeley Streaming Algorithms |

Ben EdelmanPhD StudentHarvard University Sensitivity Conjecture |

Sanjeev KhannaHenry Salvatori ProfessorUniversity of Pennsylvania Markov Chains and Random Walks |

Chandra ChekuriProfessorUniversity of Illinois, Urbana-Champaign Packing and Covering Problems, Randomized Rounding |

David WilliamsonProfessorCornell University Minimum Cut, Multiplicative Weights, EkSAT, and Maximum Cut |

Matt WeinbergAssistant ProfessorPrinceton University Job Scheduling on Unrelated Machines |

Ezra EdelmanUndergraduatePrinceton University IP and ♯P Complexity Classes, ♯SAT |

Sepehr AssadiPostdocPrinceton University Sublinear Algorithms for Graph Coloring |

Joel SpencerSilver ProfessorNew York University Unicyclic Graphs and Algorithmic Lovász Local Lemma |

Keaton NaffPhD StudentColumbia University Optimal Transport Problem |

Margaret LiResearch Engineer, Facebook AI ResearchFacebook AI Research Reinforcement Learning |

Alex LinResearch Engineer, ASAPPHarvard University Machine Learning |

**Summer 2018**

David WilliamsonProfessorCornell University Submodular Function Maximization, TSP, Max-SAT, and Max-Cut |

Ben EdelmanPhD StudentHarvard University Tree Metrics |

Sepehr AssadiPhD StudentUniversity of Pennsylvania Communication Complexity |

Matt WeinbergAssistant ProfessorPrinceton University Prophet Inequalities |

Sanjeev KhannaHenry Salvatori ProfessorUniversity of Pennsylvania Edge Disjoint Paths |

Zeev DvirAssistant ProfessorPrinceton University Private Information Retrieval |

Pravesh KothariResearch InstructorPrinceton University Quantum Computing |

Arvind NarayananAssociate ProfessorPrinceton University Modern Cryptography |

Prathamesh Patil PhD StudentUniversity of Pennsylvania Secretary Problems |

Nishita JainUndergraduateUniversity of Pennsylvania Blockchain |

**Summer 2017**

Hrishikesh KhandeparkarUndergraduatePrinceton University High Dimensional Geometry and the Multiplicative Weights Method |

Matt Weinberg Assistant ProfessorPrinceton University Department of Computer Science Secretary Problems |

Margaret LiSoftware Engineer, FacebookUniversity of Pennsylvania Zero-Knowledge Proofs |

Sanjeev KhannaHenry Salvatori ProfessorComputer and Information Science University of Pennsylvania Random Walks, LP-rounding |

Aravind SrinivasanProfessorDepartment of Computer Science University of Maryland, College Park Lovász Local Lemma |

Ben EdelmanUndergraduatePrinceton University Introduction to Coding Theory, Tree Metrics |

Shreyas PaiGraduate StudentUniversity of Iowa Distributed Algorithms (MIS and 3-Coloring Directed Rooted Trees) |

Viswanath NagarajanAssistant ProfessorUniversity of Michigan Industrial & Operations Engineering Department Stochastic Optimizations |

Sriram PemmarajuProfessorUniversity of Iowa Graph Sketches |

**Summer 2016**

David WilliamsonProfessorSchool of Operations Research and Information Engineering Department of Information Science Cornell University The Design of Approximation Algorithms Submodular Maximization |

Zeev DvirAssistant ProfessorDepartment of Computer Science Department of Mathematics Princeton University Incidence Theorems |

Lisa ZhangResearcherMathematics of Networks and Systems Research Department Minimum Inconsistency |

Ricson ChengUndergraduateCarnegie Mellon University Reconciliation Clustering |

Arvind NarayananAssistant ProfessorDepartment of Computer Science Princeton University Cryptography |

Hoon OhUndergraduateRutgers University Algorithmic Game Theory |

Sanjeev KhannaHenry Salvatori ProfessorComputer and Information Science University of Pennsylvania Fingerprinting and Sublinear Algorithms |

Sampath KannanProfessorUniversity of Pennsylvania Turing Machines |

Sanjeev AroraCharles C. Fitzmorris ProfessorDepartment of Computer Science Princeton University Decision Theory |

Olenka JainUndergraduateHarvard University PTAS For Scheduling with Parallel Machines |

Hrishikesh KhandeparkarUndergraduatePrinceton University Fibonacci Heaps |

Ben EdelmanUndergraduatePrinceton University Tree Metrics |

Alex LinUndergraduateHarvard University Local Search Algorithms |

**Summer 2015**

Daniel HsuAssistant ProfessorDepartment of Computer Science Data Science Institute Columbia University High Dimensional Geometry |

Yingyu LiangPostDoc FellowDepartment of Computer Science Princeton University Clustering |

David WilliamsonProfessorSchool of Operations Research and Information Engineering Department of Information Science Cornell University The Design of Approximation Algorithms Submodular Maximization |

Pranjal AwasthiPostDoc FellowDepartment of Computer Science Princeton University Machine Learning |

Aaditya RamdasPostDoc FellowDepartment of Computer Science University of California, Berkeley Singular Value Decomposition |

David JacobowitzUndergraduatePrinceton University Mathematics and Computer Science: Revolutionizing Biology and Medicine |

Varun PrabhakarUndergraduateUniversity of Pennsylvania The Probabilistic Method |

Rakesh VohraGeorge A. Weiss and Lydia Bravo Weiss University ProfessorDepartment of Electrical and Systems Engineering Department of Computer and Information Science University of Pennsylvania Linear Programming |

Samir KhullerProfessor and Elizabeth Iribe ChairSchool of Computer Science University of Maryland Scheduling |

Michael DinitzAssistant ProfessorDepartment of Computer Science Johns Hopkins University Spanners |

Po-Ling LohAssistant Professor of StatisticsDepartment of Statistics Wharton School University of Pennsylvania Graphical Models |

Samory KpotufeAssistant ProfessorOperations Research & Financial Engineering Princeton University Fast Search Algorithms |

Sanjeev AroraCharles C. Fitzmorris ProfessorDepartment of Computer Science Princeton University Semantic Vectors |

Alex LinUndergraduateHarvard University Steiner Tree-Related Problems, Local Search Algorithms, Polynomial-Time Approximation Schemes |

Ben EdelmanUndergraduatePrinceton University Tree Metrics |

**Summer 2014**

Mark BravermanAssistant ProfessorProgram in Applied and Computational Mathematics Department of Computer Science Princeton University Interactive Proofs |

Zeev DvirAssistant ProfessorDepartment of Computer Science Department of Mathematics Princeton University Incidence Theorems |

David JacobowitzUndergraduatePrinceton University Mathematics and Computer Science: Revolutionizing Biology and Medicine |

Sanjeev KhannaHenry Salvatori ProfessorComputer and Information Science University of Pennsylvania Fingerprinting and PCP Theorem |

Michael SaksProfessorDepartment of Mathematics Rutgers University Coloring Planar Graphs |

Aravind SrinivasanProfessorDepartment 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) ZhaoUndergraduatePrinceton University Game Theory |

**Summer 2013**

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

Eric AllenderDistinguished ProfessorDepartment of Computer Science Rutgers University Complexity and Randomness |

Amey BhangalePh.D. StudentDepartment of Computer Science Rutgers University Arithmetic Circuit Complexity |

Mark BravermanAssistant ProfessorProgram in Applied and Computational Mathematics Department of Computer Science Princeton University Probabilistic Method |

Zeev DvirAssistant ProfessorDepartment of Computer Science Department of Mathematics Princeton University Cryptography |

Samir KhullerProfessor and ChairSchool of Computer Science University of Maryland Primal-Dual Algorithms for Vertex Cover |

David WilliamsonProfessorSchool 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-VromanPh.D StudentDepartment of Computer Science Rutgers University Huffman Encoding |

Arnab BhattacharyyaPost-DoctorateDepartment of Computer Science Princeton University Sub-Linear Algorithms |

Mark BravermanAssistant ProfessorDepartment of Computer Science Princeton University Probabilistic Method |

Zeev DvirAssistant ProfessorDepartment of Computer Science Department of Mathematics Princeton University Incidence Theorems |

Swastik KoppartyProfessorDepartment of Mathematics Department of Computer Science Rutgers University Secure Multiparty Computation and Secret Sharing |

Shachar LovettMemberSchool of Mathematics Institute for Advanced Study Coding Theory |

Ankur MoitraMemberSchool of Mathematics Institute for Advanced Study Zero-Sum Games in Combinatorial Optimization |

Michael SaksProfessorDepartment of Mathematics Rutgers University Coloring Planar Graphs |

**Summer 2011**

Sanjeev AroraCharles C. Fitzmorris ProfessorDepartment of Computer Science Princeton University A Polynomial Time Approximation Scheme for the Euclidean Traveling Salesperson Problem |

Moses CharikarProfessorDepartment of Computer Science Princeton University Streaming Algorithms |

Bernard ChazelleEugene Higgins ProfessorDirector of the Center for Computational IntractabilityDepartment of Computer Science Princeton University Computational Geometry |

Zeev DvirAssistant ProfessorDepartment of Computer Science Department of Mathematics Princeton University Cryptography |

Subhash KhotAssociate ProfessorDepartment of Computer Science Courant Institute of Mathematical Sciences New York University Hardness of Approximation Results and the PCP Theorem |

Ofer NeimanResearch AssociateDepartment of Computer Science Princeton University Metric Embeddings for Graphs |

Ajay RoopakaluStudentDepartment of Computer Science Princeton University Quantum Computation and Semidefinite Programming |

Nikhil SrivastavaMemberSchool of Mathematics Institute for Advanced Study Spanners in Graphs |

Robert E. TarjanJames S. McDonnell Distinguished University ProfessorSenior HP FellowDepartment of Computer Science Princeton University Algorithms for MST and Shortest Path in a Graph |