Amortized efficiency of list update and paging rules
Communications of the ACM
An optimal online algorithm for metrical task systems
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Competitive algorithms for server problems
Journal of Algorithms
Random walks on weighted graphs, and applications to on-line algorithms
STOC '90 Proceedings of the twenty-second 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
Competitive paging with locality of reference
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Lower bounds for randomized k-server and motion-planning algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Infinite games: randomization, computability, and applications to online problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Two results on the list update problem
Information Processing Letters
Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Strongly competitive algorithms for paging with locality of reference
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Some Distribution-Free Aspects of Paging Algorithm Performance
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Memory Versus Randomization in On-line Algorithms (Extended Abstract)
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The distributed k-server problem-a competitive distributed translator for k-server algorithms
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Competitive analysis of financial games
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
SFCS '92 Proceedings of the 33rd 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
| Hi-index | 0.00 |
Competitive Analysis provides a relatively new perspective for studying the performance of online algorithms and, more generally, performance in any algorithmic setting based on "incomplete knowledge." In an online setting, the competitive ratio measures the worst case (over-all request sequences) performance of an online algorithm relative to an optimal offline algorithm that has complete knowledge of the entire request sequence. As such, competitive analysis avoids assumptions about this input distribution and a rather elegant and challenging mathematical theory is being developed. But to what extent does such a theory have relevance to a "real" algorithmic design? For example, can it be used profitably in the context of data migration and replication problems, or in the context of financial investment strategies?