Two results on the list update problem
From MaRDI portal
Publication:1178243
DOI10.1016/0020-0190(91)90086-WzbMath0737.68043MaRDI QIDQ1178243
Publication date: 26 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (24)
On list update with locality of reference ⋮ The list update problem and the retrieval of sets ⋮ New results for online page replication ⋮ Off-line algorithms for the list update problem ⋮ A Randomized Algorithm for Online Scheduling with Interval Conflicts ⋮ Can Burrows-Wheeler transform be replaced in chain code compression? ⋮ A competitive analysis of the list update problem with lookahead ⋮ Paid exchanges are worth the price ⋮ Relative Worst-Order Analysis: A Survey ⋮ List update with probabilistic locality of reference ⋮ List factoring and relative worst order analysis ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ A combined BIT and TIMESTAMP algorithm for the list update problem ⋮ On the list update problem with advice ⋮ A lower bound for randomized list update algorithms ⋮ The weighted list update problem and the lazy adversary ⋮ The list update problem and the retrieval of sets ⋮ A new lower bound for the list update problem in the partial cost model ⋮ List Update with Locality of Reference ⋮ On the competitiveness of the move-to-front rule ⋮ Randomized distributed online algorithms against adaptive offline adversaries ⋮ A Survey of Algorithms and Models for List Update ⋮ On list update and work function algorithms. ⋮ Randomized competitive algorithms for the list update problem
This page was built for publication: Two results on the list update problem
