A randomized algorithm for two servers on the line.
type: Item
instance of: scholarly article
title: A randomized algorithm for two servers on the line.
zbMATH Open document ID: 1046.68982
author: Marek Chrobak
author: Yair Bartal
author: Lawrence L. Larmore
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1853100
zbMATH Keywords: \(k\)-server problem
MaRDI profile type: Publication
full work available at URL: inco.1999.2809
OpenAlex ID: W2039381785
cites work: Competitive analysis of randomized paging algorithms
cites work: A combined BIT and TIMESTAMP algorithm for the list update problem
cites work: Q4527040
cites work: Q4230341
cites work: Sequencing Problems in Two-Server Systems
cites work: New Ressults on Server Problems
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: Q4010306
cites work: A better lower bound on the competitive ratio of the randomized 2-server problem
cites work: Randomized algorithms for metrical task systems
cites work: Competitive randomized algorithms for nonuniform problems
cites work: On the \(k\)-server conjecture
cites work: On the k -server conjecture
cites work: The 2-evader problem
cites work: Q3128899
cites work: Competitive algorithms for server problems
cites work: A strongly competitive randomized paging algorithm
DOI: 10.1006/INCO.1999.2809
description: scientific article; zbMATH DE number 1853100