On the power of randomization in on-line algorithms
- 1 January 1994
- journal article
- Published by Springer Science and Business Media LLC in Algorithmica
- Vol. 11 (1), 2-14
- https://doi.org/10.1007/bf01294260
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Competitive k-server algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- Random walks on weighted graphs, and applications to on-line algorithmsPublished by Association for Computing Machinery (ACM) ,1990
- Competitive snoopy cachingAlgorithmica, 1988
- An optimal online algorithm for metrical task systemsPublished by Association for Computing Machinery (ACM) ,1987
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Borel DeterminacyAnnals of Mathematics, 1975