Limited bookmark randomized online algorithms for the paging problem
References (10)
- et al.
Trackless online algorithms for the server problem
Inform. Process. Lett.
(2000) - et al.
Competitive paging with locality of reference
J. Comput. Systems Sci.
(1995) - et al.
HARMONIC is three-competitive for two servers
Theoret. Comput. Sci.
(1992) - et al.
A competitive 2-server algorithm
Inform. Process. Lett.
(1991) - et al.
Competitive analysis of randomized paging algorithms
There are more references available in the full text version of this article.
Cited by (0)
- 1
Research supported by NSF grant CCR-9821009.
Copyright © 2000 Elsevier Science B.V. All rights reserved.