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.

2018

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…

2012

This paper considers a Train Shunting problem which occurs in cargo train organizations: We have a locomotive travelling along a…

2009

Review

2004

Review

2004

In this survey, we discuss two randomized online algorithms for the list access problem. First, we review competitive analysis…

2002

1999

An on-line algorithm for the list update problem has been proposed and is shown to be 2-competitive under any sequence of access…

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…