Generosity helps, or an 11–competitive algorithm for three servers
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On page migration and other relaxed task systems
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On page migration and other relaxed task systems
Theoretical Computer Science
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
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
New Results on the k-Truck Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
DCW '00 Proceedings of the Third International Workshop on Distributed Communities on the Web
A Randomized Algorithm for Two Servers on the Line (Extended Abstract)
ESA '98 Proceedings of the 6th 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
More on randomized on-line algorithms for caching
Theoretical Computer Science
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Can competitive analysis be made competitive?
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
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
The CNN problem and other k-server variants
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
The generalized two-server problem
Journal of the ACM (JACM)
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Theoretical Computer Science
Competitive algorithms for the bicriteria k-server problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomized Competitive Analysis for Two-Server Problems
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
A competitive algorithm for the general 2-server problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A randomized algorithm for two servers in cross polytope spaces
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On the bicriteria k-server problem
ACM Transactions on Algorithms (TALG)
Towards the randomized k-server conjecture: a primal-dual approach
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Computer Science Review
A Primal-Dual Randomized Algorithm for Weighted Paging
Journal of the ACM (JACM)
The k-resource problem in uniform metric spaces
Theoretical Computer Science
| Hi-index | 0.01 |