Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,029,835 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
5 relations
Adversary model
Competitive analysis (online algorithm)
Online algorithm
Potential method
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
Revisiting the COUNTER Algorithms for List
U. Albers
,
Michael MitzenmacheryAbstractCOUNTER
2009
Corpus ID: 11871841
Review
2008
Review
2008
On-line Algorithms 3 List of Participants
S. Albers
2008
Corpus ID: 44027698
A Survey of Self-Organizing Data-Structures Susanne Albers and Jeffery Westbrook Self-organizing data structures modify their…
Expand
Review
2004
Review
2004
MTF , BIT , and COMB : A Guide to Deterministic and Randomized Online Algorithms for the List Access Problem
Kevin Andrew kandrew
2004
Corpus ID: 17547817
In this survey, we discuss two randomized online algorithms for the list access problem. First, we review competitive analysis…
Expand
2002
2002
On the List Update Problem
S. Albers
2002
Corpus ID: 63762964
1999
1999
A New Lower Bound for the List Update Problem in the Partial Cost Model June
B. Stengel
1999
Corpus ID: 18708636
The optimal competitive ratio for a randomized online list update algorithm is known to be at least and at most but the remaining…
Expand
1998
1998
Untersuchungen zum List-Update-Problem
Christoph Ambuhl
1998
Corpus ID: 62301178
1994
1994
A Distributed List Update
ProblemSunil M. ShendeDepartment
1994
Corpus ID: 1772872
The list update problem is studied in a distributed environment where the set of items is partitioned across two processors and…
Expand