Anupam Gupta

About

Anupam Gupta is a faculty member in the Theoretical Computer Science Group at New York University. His research focuses on algorithms, specifically in the areas of approximation algorithms, online algorithms, and metric embeddings. As part of a group that applies mathematical tools to various disciplines within computer science, his work contributes to advancing the understanding and development of efficient algorithmic solutions. The group at NYU is engaged in a broad range of theoretical computer science topics, including security, systems, and computational geometry, situating Gupta's research within a vibrant and interdisciplinary academic environment.

Research topics

• Computer Science
• Algorithm
• Machine Learning
• Mathematics
• Political Science
• Sociology
• Law
• Artificial Intelligence
• Combinatorics
• Discrete mathematics

Selected publications

• Structural iterative rounding for generalized k-median problems

  Mathematical Programming · 2024-07-10 · 5 citations

  articleOpen access1st authorCorresponding

  Abstract This paper considers approximation algorithms for generalized k -median problems. These problems can be informally described as k -median with a constant number of extra constraints, and includes k -median with outliers, and knapsack median. Our first contribution is a pseudo-approximation algorithm for generalized k -median that outputs a 6.387-approximate solution, with a constant number of fractional variables. The algorithm builds on the iterative rounding framework introduced by Kr…

  PublisherOA PDFDOI

• Pairwise-Independent Contention Resolution

  Lecture notes in computer science · 2024-01-01 · 3 citations

  book-chapter1st author
  PublisherDOI

• Nonadaptive Stochastic Score Classification and Explainable Half-Space Evaluation

  Operations Research · 2024-07-18 · 2 citations

  article

  Nonadaptive Stochastic Score Classification Sequential testing problems involve a system with several components, each of which is working with some independent probability. The working/failed status of each component can be determined by performing a test, which is usually expensive. So, the goal is to perform tests in a carefully chosen sequence until the overall system status can be evaluated. These problems arise in a variety of applications, such as healthcare, manufacturing, and telecommun…

  PublisherDOI

• MAC Advice for facility location mechanism design

  2024-01-01 · 2 citations

  article
  PublisherDOI

• Configuration balancing for stochastic requests

  Mathematical Programming · 2024-08-08 · 2 citations

  articleOpen access

  Abstract The configuration balancing problem with stochastic requests generalizes well-studied resource allocation problems such as load balancing and virtual circuit routing. There are given m resources and n requests; each request has multiple possible configurations , each of which increases the load of each resource by some amount. The goal is to select one configuration for each request to minimize the makespan : the load of the most-loaded resource. In the stochastic setting, the amount by…

  PublisherOA PDFDOI

Recent grants

• AF: Small: Future Directions in Approximation Algorithms Research

  NSF · $415k · 2010–2015

• BSF: 2014414: New Challenges and Perspectives in Online Algorithms

  NSF · $40k · 2015–2019

• AF: Small: New Approaches for Approximation and Online Algorithms

  NSF · $300k · 2019–2021

Frequent coauthors

• Amit Kumar

  Intel (India)

  95 shared

• Viswanath Nagarajan

  Karpagam Academy of Higher Education

  61 shared

• Ravishankar Krishnaswamy

  Microsoft Research (India)

  59 shared

• Sahil Singla

  48 shared

• R. Ravi

  41 shared

• Kunal Talwar

  40 shared

• Jason Li

  33 shared

• Euiwoong Lee

  28 shared

Labs

• Theoretical Computer Science at NYUPI

  Applying mathematical tools to a variety of disciplines in computer science

Education

• Ph.D.

  University of California, Berkeley

  2000

• Other

  Indian Institute of Technology, Kanpur

  1996

Awards & honors

• Herb Simon Award for Teaching Excellence at Carnegie Mellon
• ACM Fellow in 2021

Similar researchers at New York University

• Rob Fergush-95
• Dennis Shashah-84
• Mehryar Mohrih-77