Amortized efficiency of list update and paging rules
Communications of the ACM
Competitive paging with locality of reference
Selected papers of the 23rd annual ACM symposium on Theory of computing
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Experimental studies of access graph based heuristics: beating the LRU standard?
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Bounding the diffuse adversary
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On-line paging against adversarially biased random inputs
Journal of Algorithms
An anomaly in space-time characteristics of certain programs running in a paging machine
Communications of the ACM
Smoothed analysis of the perceptron algorithm for linear programming
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Accommodating Function: A Generalization of the Competitive Ratio
SIAM Journal on Computing
SIAM Journal on Computing
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Competitive Analysis of Paging
Developments from a June 1996 seminar on Online algorithms: the state of the art
Developments from a June 1996 seminar on Online algorithms: the state of the art
Speed is as powerful as clairvoyance [scheduling problems]
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Separating the Accommodating Ratio from the Competitive Ratio
Separating the Accommodating Ratio from the Competitive Ratio
An Improved Lower Bound on First-Fit''s Accommodating Ratio for the Unit Price Bin Packing Problem
An Improved Lower Bound on First-Fit''s Accommodating Ratio for the Unit Price Bin Packing Problem
On-line maximizing the number of items packed in variable-sized bins
Acta Cybernetica
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem
Journal of Scheduling - Special issue: On-line algorithm part I
Seat reservation allowing seat changes
Journal of Algorithms
The relative worst order ratio applied to paging
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
The relative worst order ratio for on-line algorithms
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
An online algorithm optimally self-tuning to congestion for power management problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
Pros and cons of the competitive analysis have been discussed in the literature by many authors. Continuing this discussion in this quarter s column, Reza Dorrigiv and Alejandro Lopez-Ortiz review and compare various performance measures for online algorithms, highlighting their differences with respect to the competitive ratio. Many thanks to Reza and Alejandro for contributing this article.