Anupam Gupta

Anupam Gupta is a Silver Professor at the Department of Computer Science, Courant Institute of Mathematical Sciences, New York University. Previously, he was affiliated with Carnegie Mellon University. His academic journey includes a Ph.D. from the University of California, Berkeley (2000) and a B.Tech. from the Indian Institute of Technology, Kanpur (1996).

• Education:
  • Ph.D., University of California, Berkeley (2000)
  • B.Tech., Indian Institute of Technology, Kanpur (1996)

Research Interests: Anupam's research lies at the intersection of theoretical computer science and algorithm design. He focuses on approximation algorithms for stochastic and online environments, metric embeddings, and algorithmic problems in network design, clustering, and optimization. His work bridges theoretical insights with practical applications in uncertain and dynamic settings.

Publications & Trends: His recent publications highlight advancements in online algorithms with adversarial corruptions, stochastic optimization, and approximation techniques for problems like k-server, set cover, and graph searching. Key trends include leveraging predictions, balancing adaptivity and robustness, and exploring the interplay between machine learning and classical algorithm design.

• Scientific Awards:
  • ACM Fellow (2021)
  • Alfred P. Sloan Research Fellowship
  • NSF CAREER Award
  • Herb Simon Award for Teaching Excellence (Carnegie Mellon University)

Advising & Grants: He has mentored numerous Ph.D. students and postdoctoral fellows. His research is supported by grants from the National Science Foundation (NSF), including a CAREER Award, and collaborative funding for algorithmic initiatives like the Simons Institute program and the Joint Indo-US Networked Center for Algorithms under Uncertainty.