List update problem

The List Update or the List Access problem is a simple model used in the study of competitive analysis of online algorithms. Given a set of items in…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

This paper presents a machine-verified analysis of a number of classical algorithms for the list update problem: 2…

2015

This column is devoted to the memory of Ferran Hurtado who unexpectedly passed away in 2014. In writing this column we remember…

2013

The List-Update Problem is a well studied online problem with direct applications in data compression. Although the model…

2010

The list update problem is a classical online problem, with an optimal competitive ratio that is still open, known to be…

2009

2009

It has long been known that for the paging problem in its standard form, competitive analysis cannot adequately distinguish…

2008

It is known that in practice, request sequences for the list update problem exhibit a certain degree of locality of reference…

Review

2005

Review

2005

Pros and cons of the competitive analysis have been discussed in the literature by many authors. Continuing this discussion in…

1998

We study the Relaxed List Update Problem (RLUP), in which access requests are made to items stored in a list. The cost to access…

1993

We introduce a new model of lookahead for on-line paging algorithms and study several algorithms using this model. A paging…