Competitive randomized algorithms for nonuniform problems
- 1 June 1994
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 11 (6) , 542-571
- https://doi.org/10.1007/bf01189993
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Evaluating The Performance Of Four Snooping Cache Coherency ProtocolsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- On the power of randomization in on-line algorithmsAlgorithmica, 1994
- Random walks on weighted graphs and applications to on-line algorithmsJournal of the ACM, 1993
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A New Approach to the Server ProblemSIAM Journal on Discrete Mathematics, 1991
- New Ressults on Server ProblemsSIAM Journal on Discrete Mathematics, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- The harmonic online K-server algorithm is competitivePublished by Association for Computing Machinery (ACM) ,1991
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987