activity
20092026
most citedUnderstanding Fashion Cycles as a Social Choice

15 citations · 50 across the 24 of their papers we have counts for

collaborators
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2025

Why is My Route Different Today? An Algorithm for Explaining Route Selection

Aaron Schild, Sreenivas Gollapudi, Anupam Gupta +2

Users of routing services like Apple Maps, Google Maps, and Waze frequently wonder why a given route is proposed. This question particularly arises when dynamic conditions like tra…

cs.DS2025

Online Distributed Queue Length Estimation

Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2

Queue length monitoring is a commonly arising problem in numerous applications such as queue management systems, scheduling, and traffic monitoring. Motivated by such applications,…

cs.DS2024

First Passage Percolation with Queried Hints

Kritkorn Karntikoon, Yiheng Shen, Sreenivas Gollapudi +3

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the informati…

cs.DS2022

Online Learning and Bandits with Queried Hints

Aditya Bhaskara, Sreenivas Gollapudi, Sungjin Im +2

We consider the classic online learning and stochastic multi-armed bandit (MAB) problems, when at each step, the online policy can probe and find out which of a small number ()…

cs.DS2019★ 3 cited

Hiring Under Uncertainty

Manish Raghavan, Manish Purohit, Sreenivas Gollupadi

In this paper we introduce the hiring under uncertainty problem to model the questions faced by hiring committees in large enterprises and universities alike. Given a set of el…

cs.DS2018

Minimizing Latency in Online Ride and Delivery Services

Abhimanyu Das, Sreenivas Gollapudi, Anthony Kim +2

Motivated by the popularity of online ride and delivery services, we study natural variants of classical multi-vehicle minimum latency problems where the objective is to route a se…

cs.DS2017★ 5 cited

Algorithms for Low Rank Approximation

Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar +3

We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise -approximation error, for any ; the case is t…