Amortized efficiency of list update and paging rules
Communications of the ACM
Self-adjusting binary search trees
Journal of the ACM (JACM)
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
No. 318 on SWAT 88: 1st Scandinavian workshop on algorithm theory
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An optimal on-line algorithm for K-servers on trees
SIAM Journal on Computing
The harmonic online K-server algorithm is competitive
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
New results on server problems
SIAM Journal on Discrete Mathematics
On the value of information in distributed decision-making (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
A competitive 2-server algorithm
Information Processing Letters
On fast algorithms for two servers
Journal of Algorithms
Journal of Algorithms
Competitive algorithms for layered graph traversal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
New algorithms for an ancient scheduling problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
HARMONIC is a 3–competitive for two servers
Theoretical Computer Science
An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
An on-line scheduling heuristic with better worst case ratio than Graham's list scheduling
SIAM Journal on Computing
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Random walks on weighted graphs and applications to on-line algorithms
Journal of the ACM (JACM)
Generosity helps or an 11-competitive algorithm for three servers
Journal of Algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Memory versus randomization in on-line algorithms
IBM Journal of Research and Development
Journal of the ACM (JACM)
On-line algorithms and the K-server conjecture
On-line algorithms and the K-server conjecture
Information Processing Letters
Page replacement with multi-size pages and applications to Web caching
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A polylog(n)-competitive algorithm for metrical task systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On approximating arbitrary metrices by tree metrics
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Journal of Algorithms - Special issue on SODA '95 papers
A competitive 3-server algorithm
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
SIAM Journal on Computing
More on random walks, electrical networks, and the harmonic k-server algorithm
Information Processing Letters
The 3-server problem in the plane
Theoretical Computer Science
Competitive Distributed Decision-Making
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The CNN Problem and Other k-Server Variants
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Computational Aspacts of Organization Theory (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On metric ramsey-type phenomena
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Weak Adversaries for the k-Server Problem
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Better Algorithms for Unfair Metrical Task Systems and Applications
SIAM Journal on Computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
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
A Primal-Dual Randomized Algorithm for Weighted Paging
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Randomized k-server on hierarchical binary trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Competitive k-server algorithms
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A decomposition theorem and bounds for randomized server problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
A competitive algorithm for the general 2-server problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the advice complexity of the k-server problem
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Strategy-proof mechanisms for facility location games with many facilities
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
The communication complexity of distributed task allocation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
The k-resource problem in uniform metric spaces
Theoretical Computer Science
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
| Hi-index | 0.00 |
The k-server problem is perhaps the most influential online problem: natural, crisp, with a surprising technical depth that manifests the richness of competitive analysis. The k-server conjecture, which was posed more than two decades ago when the problem was first studied within the competitive analysis framework, is still open and has been a major driving force for the development of the area online algorithms. This article surveys some major results for the k-server problem.