A new measure for the study of on-line algorithms
- 1 January 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 11 (1) , 73-91
- https://doi.org/10.1007/bf01294264
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Competitive k-server algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Thek-server dual and loose competitiveness for pagingAlgorithmica, 1994
- An optimal on-line algorithm for metrical task systemJournal of the ACM, 1992
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- The harmonic online K-server algorithm is competitivePublished by Association for Computing Machinery (ACM) ,1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- Competitive snoopy cachingAlgorithmica, 1988
- Competitive algorithms for on-line problemsPublished by Association for Computing Machinery (ACM) ,1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Powers of graphsPublished by Association for Computing Machinery (ACM) ,1984