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)

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)

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)

Is this relevant?

1998

1998

- Sachin Lodha
- 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

- Nick Reingold, Jeffery Westbrook
- Inf. Process. Lett.
- 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

- Susanne Albers, Bernhard von Stengel, Ralph Werchner
- Inf. Process. Lett.
- 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

- Susanne Albers
- SODA
- 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

- Rahul Simha, Amitava Majumdar
- Inf. Process. Lett.
- 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

- Sandy Irani
- Inf. Process. Lett.
- 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

- Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator
- Algorithmica
- 1991

We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjanâ€¦Â (More)

Is this relevant?