Randomized algorithms for metrical task systems
From MaRDI portal
Publication:1127546
DOI10.1016/S0304-3975(97)00006-6zbMATH Open0911.68071MaRDI QIDQ1127546FDOQ1127546
Authors: Sandy Irani, S. S. Seiden 
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- On the power of randomization in on-line algorithms
- Self-adjusting binary search trees
- Competitive randomized algorithms for nonuniform problems
- Competitive algorithms for server problems
- Title not available (Why is that?)
- An optimal on-line algorithm for metrical task system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Traversing Layered Graphs Using the Work Function Algorithm
- Title not available (Why is that?)
- Randomized algorithms for metrical task systems
Cited In (16)
- Ramsey-type theorems for metric spaces with applications to online problems
- An optimal on-line algorithm for metrical task system
- Title not available (Why is that?)
- Online computation with advice
- On multi-threaded metrical task systems
- Parametrized Metrical Task Systems
- Better Algorithms for Unfair Metrical Task Systems and Applications
- Unfair problems and randomized algorithms for metrical task systems
- Better algorithms for unfair metrical task systems and applications
- Randomized algorithms for metrical task systems
- A combinatorial metrical task system problem under the uniform metric
- Title not available (Why is that?)
- Competitive analysis of randomized paging algorithms
- Uniform metrical task systems with a limited number of states
- STACS 2004
- A regularization approach to metrical task systems
This page was built for publication: Randomized algorithms for metrical task systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127546)
