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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
02419912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We study the online list update problem under the advice model of computation. Under this model, an online algorithm receives… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2002
2002
An unsorted linear list is one of the simplest data structures on which one can perform insertions, deletions and lookups. To… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • table 2.1
Is this relevant?
1998
1998
We present an optimal on-line algorithm for the List Update Problem when the request sequence has some particular structure. 
Is this relevant?
1996
1996
Optimum oo-line algorithms for the list update problem are investigated. The list update problem involves implementing a… (More)
Is this relevant?
1995
1995
We present a randomized on-line algorithm for the list update problem which achieves a competitive factor of 1.6, the best known… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
The best randomized on-line algorithms known so far for the list update problem achieve a competitiveness of a x 1.73. In this… (More)
Is this relevant?
1994
1994
The list update problem is studied in a distributed environment where the set of items is partitioned across two processors and… (More)
Is this relevant?
1994
1994
Simha, R. and A. Majumdar, On Lookahead in the List Update Problem. Information Processing Letters. We study a problem in the… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Irani, S., Two results on the list update problem, Information Processing Letters 38 (1991) 301-306. In this paper we give a… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan… (More)
  • table 1
  • table 2
Is this relevant?