On fast algorithms for two servers

DOI10.1016/0196-6774(91)90035-WMaRDI QIDQ3988823zbMATH OpenOpenAlexFDO

Authors Lawrence L. Larmore, Marek Chrobak

Publication date 28 June 1992

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(91)90035-w

zbMATH Keywords

\(k\)-server problemcompetitiveness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4215366
• A competitive 2-server algorithm
• The generalized two-server problem
• Geometric two-server algorithms
• scientific article; zbMATH DE number 2038743

Cited in

(13)

• A competitive 2-server algorithm
• Randomized competitive algorithms for the list update problem
• Competitive k-server algorithms
• A lower bound for two-server balancing algorithms
• Trackless online algorithms for the server problem
• Simple and efficient two-server ORAM
• The weighted 2-server problem
• Sequencing two servers on a sphere
• scientific article; zbMATH DE number 4215366 (Why is no real title available?)
• The \(k\)-server problem
• Breaking the 2-competitiveness barrier for two servers in a tree
• Geometric two-server algorithms
• R-LINE: a better randomized 2-server algorithm on the line

This page was built for publication: On fast algorithms for two servers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988823)