Unfair problems and randomized algorithms for metrical task systems

DOI10.1006/inco.1998.2744zbMath0936.68120OpenAlexW1986829372MaRDI QIDQ1283826

Steve Seiden

Publication date: 30 March 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7f0c978e81593d89a48e16716af8d758a10efc2b

zbMATH Keywords

metrical task systems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items

New results for online page replication ⋮ Uniform metrical task systems with a limited number of states ⋮ Parametrized Metrical Task Systems ⋮ Ramsey-type theorems for metric spaces with applications to online problems ⋮ Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing ⋮ A general decomposition theorem for the \(k\)-server problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive snoopy caching
• Randomized algorithms for metrical task systems
• Competitive randomized algorithms for nonuniform problems
• Competitive algorithms for server problems
• Self-adjusting binary search trees
• An optimal on-line algorithm for metrical task system
• Randomized algorithms for metrical task systems