AbstractThe list update problem, a well-studied problem in dynamic data structures, can be described abstractly as a metrical task system. In this paper, we prove that a generic metrical task system algorithm, called the work function algorithm, has constant competitive ratio for list update. In the process, we present a new formulation of the well-known “list factoring” technique in terms of a partial order on the elements of the list. This approach leads to a new simple proof that a large class of online algorithms, including Move-To-Front, is (2−1/k)-competitive, for k the list length
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search...
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence o...
AbstractWe consider the list access problem and show that one questionable assumption in the origina...
AbstractThe list update problem, a well-studied problem in dynamic data structures, can be described...
We consider the question of lookahead in the list update problem: What improvement can be achieved i...
AbstractWe consider the list update problem under a sequence of requests for sets of items, and for ...
AbstractWe consider the question of lookahead in the list update problem: What improvement can be ac...
The list update problem is a classical online problem, with an optimal competitive ratio that is sti...
The best randomized on-line algorithms known so far for the list update problem achieve a competitiv...
The list update problem is a classical online problem, with an optimal competitive ratio that is sti...
This paper presents a machine-verified analysis of a number of classical algorithms for the list upd...
COUNTER algorithms, a family of randomized algorithms for the list update problem, were introduced b...
We present a comprehensive study of the list update problem with locality of reference. More specifi...
We consider the list access problem and show that one questionable assumption in the original cost m...
In this paper we present some deterministic and randomized algorithms for the Weight List Update Pro...
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search...
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence o...
AbstractWe consider the list access problem and show that one questionable assumption in the origina...
AbstractThe list update problem, a well-studied problem in dynamic data structures, can be described...
We consider the question of lookahead in the list update problem: What improvement can be achieved i...
AbstractWe consider the list update problem under a sequence of requests for sets of items, and for ...
AbstractWe consider the question of lookahead in the list update problem: What improvement can be ac...
The list update problem is a classical online problem, with an optimal competitive ratio that is sti...
The best randomized on-line algorithms known so far for the list update problem achieve a competitiv...
The list update problem is a classical online problem, with an optimal competitive ratio that is sti...
This paper presents a machine-verified analysis of a number of classical algorithms for the list upd...
COUNTER algorithms, a family of randomized algorithms for the list update problem, were introduced b...
We present a comprehensive study of the list update problem with locality of reference. More specifi...
We consider the list access problem and show that one questionable assumption in the original cost m...
In this paper we present some deterministic and randomized algorithms for the Weight List Update Pro...
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search...
In the competitive analysis of on-line problems, an on-line algorithm is presented with a sequence o...
AbstractWe consider the list access problem and show that one questionable assumption in the origina...