A note on the server problem and a benevolent adversary
type: Item
instance of: scholarly article
title: A note on the server problem and a benevolent adversary
zbMATH Open document ID: 0739.68041
DOI: 10.1016/0020-0190(91)90095-Y
author: Marek Chrobak
author: Lawrence L. Larmore
published in: Information Processing Letters
publication date: 1992-06-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 23334
zbMATH Keywords: server problem
zbMATH Keywords: competitive analysis
MaRDI profile type: Publication
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: A New Approach to the Server Problem
cites work: Competitive algorithms for server problems
Recommended article: Unbounded lower bound for k-server against weak adversaries
Recommended article: Proofs of conjectures on the competition between observable and unobservable servers
Recommended article: An Asynchronous Computability Theorem for Fair Adversaries
Recommended article: On the Advice Complexity of the k-Server Problem
Recommended article: On the advice complexity of the \(k\)-server problem
Recommended article: On the complexity of asynchronous agreement against powerful adversaries
Recommended article: More is less: perfectly secure oblivious algorithms in the multi-server setting
Recommended article: Q5874248
Recommended article: On the k -server conjecture
description: scientific article; zbMATH DE number 23334