scientific article; zbMATH DE number 65695

MaRDI QIDQ4010306zbMATH OpenFDO

Authors Lawrence L. Larmore, Marek Chrobak

Publication date 27 September 1992

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

(36)

• Competitive algorithms for the bicriteria \(k\)-server problem
• 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
• Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
• The online \(k\)-server problem with rejection
• Tight bounds for double coverage against weak adversaries
• An on-line multi-CBR agent dispatching algorithm
• Randomized algorithms for metrical task systems
• Dynamic location problems with limited look-ahead
• Unfair problems and randomized algorithms for metrical task systems
• On the additive constant of the \(k\)-server work function algorithm
• The \(k\)-server problem
• Randomized Competitive Analysis for Two-Server Problems
• Stochastic dominance and the bijective ratio of online algorithms
• Metrical service systems with multiple servers
• Metrical service systems with transformations
• Trackless online algorithms for the server problem
• The 2-evader problem
• Towards the k-server conjecture: a unifying potential, pushing the frontier to the circle
• 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
• Collective tree exploration via potential function method
• Randomized competitive analysis for two server problems
• Shortest paths without a map, but with an entropic regularizer
• The online \(k\)-server problem with max-distance objective

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)