1.5k citations · 5.7k across the 60 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 1 cited
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Nikhil Bansal, Niv Buchbinder, Aleksander Madry +2
We give the first polylogarithmic-competitive randomized online algorithm for the -server problem on an arbitrary finite metric space. In particular, our algorithm achieves a co…
cs.DS2011★ 4 cited
Runtime Guarantees for Regression Problems
Hui Han Chin, Aleksander Madry, Gary Miller +1
We study theoretical runtime guarantees for a class of optimization problems that occur in a wide variety of inference problems. these problems are motivated by the lasso framework…