Managing multiple mobile resources
From MaRDI portal
Publication:5919097
DOI10.1007/s00224-020-10023-8OpenAlexW4205300695MaRDI QIDQ5919097
Till Knollmann, Friedhelm Meyer auf der Heide, Manuel Malatyali, Björn Feldkord
Publication date: 28 September 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-020-10023-8
Algorithms in computer science (68Wxx) Computer system organization (68Mxx) Operations research and management science (90Bxx)
Cites Work
- On list update with locality of reference
- A fast work function algorithm for solving the \(k\)-server problem
- A fast approximate implementation of the work function algorithm for solving the \(k\)-server problem
- On the competitive ratio of the work function algorithm for the \(k\)-server problem
- Competitive paging with locality of reference
- A new upper bound on the work function algorithm for the \(k\)-server problem
- A Polylogarithmic-Competitive Algorithm for the k -Server Problem
- New Ressults on Server Problems
- Competitive algorithms for server problems
- Competitive paging algorithms
- On the k -server conjecture
- Dynamic Beats Fixed
- Unbounded lower bound for k-server against weak adversaries
- k-server via multiscale entropic regularization
- List Update with Locality of Reference
- On page migration and other relaxed task systems
This page was built for publication: Managing multiple mobile resources
