Related references
Note: Only part of the references are listed.A new upper bound on the work function algorithm for the k-server problem
Wenming Zhang et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2020)
Unbounded Lower Bound for k-Server against Weak Adversaries
Marcin Bienkowski et al.
PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20) (2020)
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration
Marcin Bienkowski et al.
ACM TRANSACTIONS ON ALGORITHMS (2019)
The Mobile Server Problem
Bjoern Feldkord et al.
ACM TRANSACTIONS ON PARALLEL COMPUTING (2019)
k-Server via Multiscale Entropic Regularization
Sebastien Bubeck et al.
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2018)
Fusible HSTs and the randomized k-server conjecture
James R. Lee
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2018)
On list update with locality of reference
Susanne Albers et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2016)
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
Nikhil Bansal et al.
JOURNAL OF THE ACM (2015)
A fast approximate implementation of the work function algorithm for solving the -server problem
Tomislav Rudec et al.
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2015)
A fast work function algorithm for solving the k-server problem
Tomislav Rudec et al.
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH (2013)
On the competitive ratio of the work function algorithm for the k-server problem
Y Bartal et al.
THEORETICAL COMPUTER SCIENCE (2004)
On page migration and other relaxed task systems
Y Bartal et al.
THEORETICAL COMPUTER SCIENCE (2001)
Share Paper
