A general decomposition theorem for the k-server problem
Information and Computation
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
The 3-server problem in the plane
Theoretical Computer Science
A New Competitive Analysis of Randomized Caching
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
The 3-Server Problem in the Plane
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A General Decomposition Theorem for the k-Server Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
On the competitive ratio of the work function algorithm for the k-server problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computer Science Review
The k-resource problem in uniform metric spaces
Theoretical Computer Science
| Hi-index | 0.89 |