We consider the list access problem and show that one questionable assumption in the original cost model presented by Sleator and Tarjan (Amortized Efficiency of List Update and Paging Rules, CACM, 28(2):202-208, 1985) and subsequent literature allowed for several competitiveness results of the move-to-front rule (MTF). We present an off-line algorithm for the list access problem and prove that, under a more realistic cost model, no on-line algorithm can be c-competitive for any constant c, MTF included
AbstractWe derive upper and lower bounds on total variation distance to stationarity for the distrib...
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
This paper presents a machine-verified analysis of a number of classical algorithms for the list upd...
AbstractWe consider the list access problem and show that one questionable assumption in the origina...
We consider the list access problem and show that two unrealistic assumptions in the original cost m...
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynam...
AbstractWe consider the list update problem under a sequence of requests for sets of items, and for ...
A number of data items (1,2,...,n) are to be maintained in a structure which consists of several lin...
AbstractVarious list accessing algorithms have been proposed in the literature and their performance...
AbstractThe list update problem, a well-studied problem in dynamic data structures, can be described...
We study the classical move-to-front (MTF) algorithm for self-organizing lists within the Markov-mod...
AbstractWe consider the question of lookahead in the list update problem: What improvement can be ac...
We consider the question of lookahead in the list update problem: What improvement can be achieved i...
In this survey, we discuss two randomized online algorithms for the list access problem. First, we r...
. Sequential lists are a frequently used data structure for implementing dictionaries. Recently, sel...
AbstractWe derive upper and lower bounds on total variation distance to stationarity for the distrib...
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
This paper presents a machine-verified analysis of a number of classical algorithms for the list upd...
AbstractWe consider the list access problem and show that one questionable assumption in the origina...
We consider the list access problem and show that two unrealistic assumptions in the original cost m...
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynam...
AbstractWe consider the list update problem under a sequence of requests for sets of items, and for ...
A number of data items (1,2,...,n) are to be maintained in a structure which consists of several lin...
AbstractVarious list accessing algorithms have been proposed in the literature and their performance...
AbstractThe list update problem, a well-studied problem in dynamic data structures, can be described...
We study the classical move-to-front (MTF) algorithm for self-organizing lists within the Markov-mod...
AbstractWe consider the question of lookahead in the list update problem: What improvement can be ac...
We consider the question of lookahead in the list update problem: What improvement can be achieved i...
In this survey, we discuss two randomized online algorithms for the list access problem. First, we r...
. Sequential lists are a frequently used data structure for implementing dictionaries. Recently, sel...
AbstractWe derive upper and lower bounds on total variation distance to stationarity for the distrib...
On-line algorithms are usually analyzed using competitive analysis, in which the performance of on-l...
This paper presents a machine-verified analysis of a number of classical algorithms for the list upd...
Add to ORKG