List Factoring and Relative Worst Order Analysis

Martin R. Ehmsen, Jens Svalgaard Kohrt, Kim Skak Larsen

Research output: Contribution to journalJournal articleResearchpeer-review


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. As the first contribution, it adds the static list accessing problem to the collection of online problems where relative worst order analysis gives better results. List accessing is a classic data structuring problem of maintaining optimal ordering in a linked list. It is also one of the classic problems in online algorithms, in that it is used as a model problem, along with paging and a few other problems, when trying out new techniques and quality measures. As the second contribution, this paper adds the non-trivial supplementary proof technique of list factoring to the theoretical toolbox for relative worst order analysis. List factoring is perhaps the most successful technique for analyzing list accessing algorithms, reducing the complexity of the analysis of algorithms on full-length lists to lists of length two.
Original languageEnglish
Issue number2
Pages (from-to)287-309
Number of pages23
Publication statusPublished - 2013


Dive into the research topics of 'List Factoring and Relative Worst Order Analysis'. Together they form a unique fingerprint.

Cite this