Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Online paging with arbitrary associativity
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Connection caching: model and algorithms
Journal of Computer and System Sciences
Online algorithms for prefetching and caching on parallel disks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Combining request scheduling with web caching
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Tight competitive ratios for parallel disk prefetching and caching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A proof of the optimality of the MIN paging algorithm using linear programming duality
Operations Research Letters
| Hi-index | 0.00 |