Competitive analysis of randomized paging algorithms
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 419-430
- https://doi.org/10.1007/3-540-61680-2_72
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Beyond competitive analysis [on-line algorithms]Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generosity Helps or an 11-Competitive Algorithm for Three ServersJournal of Algorithms, 1994
- On the k-server conjecturePublished by Association for Computing Machinery (ACM) ,1994
- Markov pagingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Competitive paging algorithmsJournal of Algorithms, 1991
- A strongly competitive randomized paging algorithmAlgorithmica, 1991
- An Optimal On-Line Algorithm for K Servers on TreesSIAM Journal on Computing, 1991
- Competitive paging with locality of referencePublished by Association for Computing Machinery (ACM) ,1991
- Competitive algorithms for server problemsJournal of Algorithms, 1990
- 11. Extensive Games and the Problem of InformationPublished by Walter de Gruyter GmbH ,1953