scientific article; zbMATH DE number 65695

MaRDI QIDQ4010306zbMATH OpenFDO

Authors Lawrence L. Larmore, Marek Chrobak

Publication date 27 September 1992

zbMATH Keywords

competitivenesson-line gamesserver problem

Mathematics Subject Classification ID

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

Cited in

(36)

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

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)