A competitive analysis of the list update problem with lookahead
type: Item
instance of: scholarly article
title: A competitive analysis of the list update problem with lookahead
zbMATH Open document ID: 0902.68083
DOI: 10.1016/S0304-3975(97)00026-1
author: Susanne Albers
published in: Theoretical Computer Science
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1189927
zbMATH Keywords: linear lists
zbMATH Keywords: on-line algorithms
zbMATH Keywords: competitive analysis
zbMATH Keywords: lookahead
MaRDI profile type: Publication
cites work: On the influence of lookahead in competitive paging algorithms
cites work: Q4886073
cites work: A combined BIT and TIMESTAMP algorithm for the list update problem
cites work: The weighted list update problem and the lazy adversary
cites work: A new measure for the study of on-line algorithms
cites work: On the power of randomization in on-line algorithms
cites work: Q3138891
cites work: A locally adaptive data compression scheme
cites work: Heuristics That Dynamically Organize Data Structures
cites work: On competitive on-line paging with lookahead
cites work: On a model for storage and search
cites work: A dynamic location problem for graphs
cites work: Q4886075
cites work: Q4763409
cites work: An extension of a theorem concerning an interesting Markov chain
cites work: Two results on the list update problem
cites work: Online matching with blocked input
cites work: Randomized competitive algorithms for the list update problem
cites work: On self-organizing sequential search heuristics
cites work: A lower bound for randomized list update algorithms
cites work: Q4231924
description: scientific article; zbMATH DE number 1189927