Anupam Gupta

Professor
Department of Computer Science
Carnegie Mellon University
7203 Gates Building
Pittsburgh PA 15213

Ph: (412) 268 7127
Fax: (412) 268 5576

Admin assistant: Amanda Hornick, Gates 7025, 268-5483

Email: an[you can figure this out]mg at cs DIT cmu DAH edu

I am program chair for STOC 2022, See the call for papers!
The submission deadline is Nov 4, 2021, 4:59pm EDT.

The conference is in Rome, on June 20-24, 2022.

News

Theory@CMU: The theory group and the ACO program

Upcoming theory seminars   ACO seminars   Theory Lunches at Carnegie Mellon

Theory @CMU

Most of my publications

A couple talks

Some advice on giving talks.

Publications

My research interests are in Theoretical Computer Science, with an emphasis on
Algorithms for Uncertain Environments (particularly approximation algorithms for stochastic problems,
and online algorithms) and Metric Embeddings.

My work has been supported by several grants from the NSF (including a CAREER Award),
and an Alfred P. Sloan Research Fellowship.

I was an organizer of the Algorithms and Uncertainty program at the Simons Institute in 2016.
I was also involved with the Joint Indo-US Networked Center for Algorithms under Uncertainty.

Ph.D., University of California, Berkeley, 2000
B.Tech., Indian Institute of Technology, Kanpur, 1996

Research

          C.J. Argue      Alper Cakan (with Vipul Goyal)      Roie Levin
     Madhusudhan Reddy Pittu      Sherry Sarkar      Bernardo Subercaseaux (with Marijn Heule)

Graduated: Hubert Chan (2007)    Barbara Anthony (2008)
   Mike Dinitz (2010)    Kanat Tangwongsan (2011)
   Ravishankar Krishnaswamy (2012)     Ankit Sharma (2014)
   David Witmer (2017)      Sahil Singla (2018)      Guru Guruganesh (2018)      Jason Li (2021)

Ph.D. Students

Spring 2023: I am teaching the graduate course on Advanced Algorithms. This is an intensive course for students interested in theory CS.
The webpage for Spring 2023 will come soon!

Spring 2022: I am teaching the graduate course 15-750: Algorithms in the Real World with Rashmi Vinayak
This course is a merger of the old Graduate Algorithms course, and 15-853: Algorithms in the Real World.

Teaching

Graduate Courses: 15-854: Advanced Approximation Algorithms: Fall 21
15-750: Graduate Algorithms: Spring 21
15-850: Advanced Algorithms: Fall 20
15-750: Graduate Algorithms: Spring 20
15-859FF: Coping with intractability: Exact and FPT Algorithms: Fall 19
15-850: Advanced Algorithms: Fall 18
15-850: Advanced Algorithms: Spring 17
15-854: Algorithms in the Real World: Fall 15
15-457A/859E: Advanced Algorithms: Spring 15
15-854: Algorithms in the Real World: Spring 14
Linear and Semidefinite Programming (course blog): Fall 11
Randomized Algorithms (course blog): Spring 11
Advanced Algorithms (course blog): Fall 09
Advanced Approximation Algorithms (course blog): Spring 08
Algorithms in the Real World: Fall 06
Approximation Algorithms I and II: Fall 05 and Spring 06
Randomized Algorithms: Fall 04
Metric Methods: Fall 03

Previous Undergraduate Courses: 15-451: Algorithms: S19, S18, S17, S16, F15, F14, F13
Great Theoretical Ideas In Computer Science (some notes): S04, S05, F05, F06, F07, F08, S09, F09, F10, F11