Competitive algorithms for server problems
Journal of Algorithms
A competitive 2-server algorithm
Information Processing Letters
On fast algorithms for two servers
Journal of Algorithms
Journal of Algorithms
HARMONIC is a 3–competitive for two servers
Theoretical Computer Science
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
A better lower bound on the competitive ratio of the randomized 2-server problem
Information Processing Letters
Online computation and competitive analysis
Online computation and competitive analysis
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Trackless online algorithms for the server problem
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
A simple analysis of the harmonic algorithm for two servers
Information Processing Letters
Limited bookmark randomized online algorithms for the paging problem
Information Processing Letters
More on Weighted Servers or FIFO is Better than LRU
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Competive Analysis of Randomized Paging Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
More on randomized on-line algorithms for caching
Theoretical Computer Science
| Hi-index | 0.00 |