معرفی
Anupam Gupta is an Adjunct Professor in the Computer Science Department at New York University's Courant Institute of Mathematical Sciences. Previously, he held a faculty position at Carnegie Mellon University. His research focuses on algorithms, complexity, and theoretical computer science, with an emphasis on network design, metric embeddings, and approximation algorithms. He has received notable awards, including the ACM Fellowship (2021) and the Herbert A. Simon Award for Teaching Excellence (2019).
- Education: Ph.D., University of California, Berkeley (2000); B.Tech., Indian Institute of Technology Kanpur (1996)
- Teaching: Taught courses on algorithms, theoretical computer science, and real-world applications at both undergraduate and graduate levels.
- Research: Explores algorithms for uncertain environments, stochastic optimization, and online algorithms. His work bridges theoretical foundations with practical applications in networking and combinatorial optimization.
- Awards: ACM Fellow, Sloan Fellowship, and multiple teaching awards.
- Students: Advised over 15 Ph.D. students, including notable researchers in algorithms and theoretical computer science.
- Grants: Supported by NSF grants, including a CAREER Award, and collaborates on projects like the Indo-US Algorithms under Uncertainty initiative.
His work on metric embeddings and graph algorithms has had significant impacts, with contributions to approximation algorithms and competitive analysis. He actively participates in academic conferences and serves as an organizer for programs like the Simons Institute's Algorithms and Uncertainty initiative.
