Fetching the paper…
Reading the bibliography…
Bounds for certain multiprocessing anomalies
Ronald L Graham · 1966
Earlier work this paper cites.
Convex analysis
R Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Lipshitz selections of multivalued mappings and traces of the Zygmund class of functions to an arbitrary compact, Dokl. Acad. Nauk SSSR 276 (1984), 559-562
P Shvartsman · 1984
Earlier work this paper cites.
Amortized efficiency of list update and paging rules
Daniel D Sleator and Robert E Tarjan · 1985
Earlier work this paper cites.
Continuity properties of selectors
Krzysztof Przesławski and David Yost · 1989
Earlier work this paper cites.
Competitive algorithms for server problems
Mark S Manasse, Lyle A McGeoch, and Daniel D Sleator · 1990
Earlier work this paper cites.
The harmonic online k-server algorithm is competitive
Edward F Grove · 1991
Earlier work this paper cites.
An optimal on-line algorithm for metrical task system
Allan Borodin, Nathan Linial, and Michael E Saks · 1992
Earlier work this paper cites.
On convex body chasing
Joel Friedman and Nathan Linial · 1993
Earlier work this paper cites.
On the k-server conjecture
Elias Koutsoupias and Christos H Papadimitriou · 1995
Earlier work this paper cites.
An elementary introduction to modern convex geometry
Keith Ball · 1997
Earlier work this paper cites.
On-line learning and the metrical task system problem
Avrim Blum and Carl Burch · 2000
Earlier work this paper cites.
Lipschitz selections of set-valued mappings and Helly’s theorem
Pavel Shvartsman · 2002
Cited alongside, same era.
The online set cover problem
Noga Alon, Baruch Awerbuch, and Yossi Azar · 2003
Cited alongside, same era.
Better algorithms for unfair metrical task systems and applications
Amos Fiat and Manor Mendel · 2003
Cited alongside, same era.
On metric Ramsey-type phenomena
Yair Bartal, Nathan Linial, Manor Mendel, and Assaf Naor · 2005
Cited alongside, same era.
Continuous selections for Lipschitz multifunctions
Ivan Kupka · 2005
Cited alongside, same era.
Ramsey-type theorems for metric spaces with applications to online problems
Yair Bartal, Béla Bollobás, and Manor Mendel · 2006
Cited alongside, same era.
Smoothed online convex optimization in high dimensions via online balanced descent
Niangjun Chen, Gautam Goel, and Adam Wierman · 2018
Later among the works it cites.
Sharp finiteness principles for Lipschitz selections
Charles Fefferman and Pavel Shvartsman · 2018
Later among the works it cites.
Improving Online Algorithms via ML Predictions
Ravi Kumar, Manish Purohit, and Zoya Svitkina · 2018
Later among the works it cites.
Competitive caching with machine learned advice
Thodoris Lykouris and Sergei Vassilvtiskii · 2018
Later among the works it cites.
A nearly-linear bound for chasing nested convex bodies
CJ Argue, Sébastien Bubeck, Michael B Cohen, Anupam Gupta, and Yin Tat Lee · 2019
Closest in time.
Metrical task systems on trees via mirror descent and unfair gluing
Sébastien Bubeck, Michael B Cohen, James R Lee, and Yin Tat Lee · 2019
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dynamic right-sizing for power-proportional data centers
Minghong Lin, Adam Wierman, Lachlan LH Andrew, and Eno Thereska · 2013
Cited alongside, same era.
A polylogarithmic-competitive algorithm for the k-server problem
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, and Joseph Naor · 2015
Cited alongside, same era.
A 2-competitive algorithm for online convex optimization with switching costs
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, and Cliff Stein · 2015
Cited alongside, same era.
Chasing convex bodies and functions
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, and Michele Scquizzato · 2016
Cited alongside, same era.
Nested convex bodies are chaseable
Nikhil Bansal, Martin Böhm, Marek Eliáš, Grigorios Koumoutsos, and Seeun William Umboh · 2018
Cited alongside, same era.
From the center of curvature of plane curves
Jacob Steiner
Cited in the paper.
Competitively chasing convex bodies
Sébastien Bubeck, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2019
Closest in time.
Beyond online balanced descent: An optimal algorithm for smoothed online optimization
Gautam Goel, Yiheng Lin, Haoyuan Sun, and Adam Wierman · 2019
Closest in time.
Chasing nested convex bodies nearly optimally
Sébastien Bubeck, Bo’az Klartag, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2020
Closest in time.
Optimal Robustness-Consistency Trade-offs for Learning-Augmented Online Algorithms
Alexander Wei and Fred Zhang · 2020
Closest in time.
Chasing convex bodies with linear competitive ratio
CJ Argue, Anupam Gupta, Guru Guruganesh, and Ziye Tang · 2021
Closest in time.