Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
Two results on the list update problem
Information Processing Letters
A lower bound for randomized list update algorithms
Information Processing Letters
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing
Online computation and competitive analysis
Online computation and competitive analysis
Best-fit bin-packing with random order
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Online list accessing algorithms and their applications: recent empirical evidence
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
SIAM Journal on Computing
Self-Organizing Data Structures
Developments from a June 1996 seminar on Online algorithms: the state of the art
A New Family of Randomized Algorithms for List Accessing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
The relative worst order ratio for online algorithms
ACM Transactions on Algorithms (TALG)
The relative worst-order ratio applied to paging
Journal of Computer and System Sciences
On the separation and equivalence of paging strategies
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The relative worst order ratio applied to seat reservation
ACM Transactions on Algorithms (TALG)
On List Update with Locality of Reference
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Theoretical Computer Science
A Comparison of Performance Measures for Online Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
List update with locality of reference
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Comparing online algorithms for bin packing problems
Journal of Scheduling
Parameterized analysis of paging and list update algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
List update with probabilistic locality of reference
Information Processing Letters
A new perspective on list update: probabilistic locality and working set
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Access graphs results for LRU versus FIFO under relative worst order analysis
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Optimal lower bounds for projective list update algorithms
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
Relative worst order analysis is a supplement or alternative to competitive analysis which has been shown to give results more in accordance with observed behavior of online algorithms for a range of different online problems. The contribution of this paper is twofold. First, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. Second, and maybe more interesting, it adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis.