scientific article; zbMATH DE number 65695

zbMATH Open0800.68489MaRDI QIDQ4010306FDOQ4010306

Authors: Lawrence L. Larmore, Marek Chrobak 

Publication date: 27 September 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

competitivenessserver problemon-line games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Game theory (91A99)

Cited In (32)

• On list update and work function algorithms.
• The work function algorithm for the paging problem
• Online computation with advice
• Knowledge state algorithms
• Paging with request sets
• The \(k\)-server problem with advice in \(d\) dimensions and on the sphere
• The online \(k\)-server problem with rejection
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
• Tight bounds for double coverage against weak adversaries
• An on-line multi-CBR agent dispatching algorithm
• Dynamic location problems with limited look-ahead
• Randomized algorithms for metrical task systems
• Unfair problems and randomized algorithms for metrical task systems
• On the additive constant of the \(k\)-server work function algorithm
• Randomized Competitive Analysis for Two-Server Problems
• The \(k\)-server problem
• Stochastic dominance and the bijective ratio of online algorithms
• Metrical service systems with multiple servers
• Trackless online algorithms for the server problem
• The 2-evader problem
• Deterministic 3-server on a circle and the limitation of canonical potentials
• A new upper bound on the work function algorithm for the \(k\)-server problem
• On the additive constant of the \(k\)-server work function algorithm
• On a Slow Server Problem
• A randomized algorithm for two servers on the line.
• The 3-server problem in the plane.
• On the competitive ratio of the work function algorithm for the \(k\)-server problem
• A general decomposition theorem for the \(k\)-server problem
• The weighted 2-server problem
• Randomized competitive analysis for two server problems
• The online \(k\)-server problem with max-distance objective
• Competitive algorithms for the bicriteria \(k\)-server problem

This page was built for publication:

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