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)
Competitive k-server algorithms
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Reducing disk power consumption in a portable computer
ACM SIGOPS Operating Systems Review
Journal of the ACM (JACM)
Page replacement for general caching problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The harmonic k-server algorithm is competitive
Journal of the ACM (JACM)
Connection caching under various models of communication
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Generalized connection caching
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
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
Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
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
On Randomization In Online Computation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Connection caching: model and algorithms
Journal of Computer and System Sciences
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
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Competitiveness via primal-dual
ACM SIGACT News
Randomized competitive algorithms for generalized caching
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
Caching Content under Digital Rights Management
Approximation and Online Algorithms
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
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
Metrical task systems and the k-server problem on HSTs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Caching is hard: even in the fault model
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A randomized algorithm for two servers in cross polytope spaces
Theoretical Computer Science
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Formal analysis of online algorithms
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
An O(log k)-competitive algorithm for generalized caching
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
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)
Randomized Competitive Algorithms for Generalized Caching
SIAM Journal on Computing
The k-resource problem in uniform metric spaces
Theoretical Computer Science
Cost-aware caching algorithms for distributed storage servers
DISC'07 Proceedings of the 21st international conference on Distributed Computing
A new approach to solve the k-server problem based on network flows and flow cost reduction
Computers and Operations Research
Lifetime and QoS-aware energy-saving buffering schemes
Journal of Systems and Software
Adaptive Search-Based Service Migration with Virtual Moves in Clouds for Mobile Accesses
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.01 |