Results 1  10
of
2,818,013
Algorithms for the List Update Problem
, 1999
"... List Update problem has been studied extensively in the area of online algorithms. In this problem we need to maintain a linear list of items and serve a sequence of requests like access, insert and delete on it. After each request the items if the list may be rearranged in order to make next reque ..."
Abstract
 Add to MetaCart
List Update problem has been studied extensively in the area of online algorithms. In this problem we need to maintain a linear list of items and serve a sequence of requests like access, insert and delete on it. After each request the items if the list may be rearranged in order to make next
List Update Problem
, 1998
"... We present an optimal online algorithm for the List Update Problem when the request sequence has some particular structure. 1 Introduction 1.1 The General Setting We investigate the List Update Problem. The problem can be briefly stated as follows : There are n different items in a doublylinked ..."
Abstract
 Add to MetaCart
We present an optimal online algorithm for the List Update Problem when the request sequence has some particular structure. 1 Introduction 1.1 The General Setting We investigate the List Update Problem. The problem can be briefly stated as follows : There are n different items in a doubly
A Distributed List Update Problem
 Inform. Process. Lett
, 1994
"... The list update problem is studied in a distributed environment where the set of items is partitioned across two processors and in which the cost of accessing an item is a combination of a list searching cost and a communication cost. A natural generalization of the MoveToFront (MTF) algorithm, ca ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The list update problem is studied in a distributed environment where the set of items is partitioned across two processors and in which the cost of accessing an item is a combination of a list searching cost and a communication cost. A natural generalization of the MoveToFront (MTF) algorithm
A competitive analysis of the list update problem with lookahead
 Theoret. Comput. Sci
, 1998
"... We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an online algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list updat ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an online algorithm sees not only the present request to be served but also some future requests? We introduce two different models of lookahead and study the list
Offline Algorithms for The List Update Problem
, 1996
"... Optimum offline algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time \Theta2 n (n \Gamma 1)!m, wh ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Optimum offline algorithms for the list update problem are investigated. The list update problem involves implementing a dictionary of items as a linear list. Several characterizations of optimum algorithms are given; these lead to optimum algorithm which runs in time \Theta2 n (n \Gamma 1)!m
Randomized Competitive Algorithms for the List Update Problem
 Algorithmica
, 1992
"... We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only d ..."
Abstract

Cited by 47 (2 self)
 Add to MetaCart
We prove upper and lower bounds on the competitiveness of randomized algorithms for the list update problem of Sleator and Tarjan. We give a simple and elegant randomized algorithm that is more competitive than the best previous randomized algorithm due to Irani. Our algorithm uses randomness only
Optimal Projective Algorithms for the List Update Problem
"... Abstract. The list update problem is a classical online problem, with an optimal competitive ratio that is still open, somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and TIMESTAMP. This and many other known ..."
Abstract
 Add to MetaCart
Abstract. The list update problem is a classical online problem, with an optimal competitive ratio that is still open, somewhere between 1.5 and 1.6. An algorithm with competitive ratio 1.6, the smallest known to date, is COMB, a randomized combination of BIT and TIMESTAMP. This and many other
Results 1  10
of
2,818,013