The list update problem and the retrieval of sets
type: Item
instance of: scholarly article
title: The list update problem and the retrieval of sets
zbMATH Open document ID: 0822.68026
DOI: 10.1016/0304-3975(94)00010-7
author: Fabrizio d'Amore
author: Vincenzo Liberatore
published in: Theoretical Computer Science
publication date: 1995-10-18T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 626300
zbMATH Keywords: retrieval of sets
zbMATH Keywords: list update problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00010-7
OpenAlex ID: W1966999110
cites work: An Optimal On-Line Algorithm for K Servers on Trees
cites work: The list update problem and the retrieval of sets
cites work: The weighted list update problem and the lazy adversary
cites work: Two results on the list update problem
cites work: Q3138960
cites work: Competitive snoopy caching
cites work: Competitive algorithms for server problems
cites work: Off-line algorithms for the list update problem
cites work: Self-adjusting binary search trees
cites work: Amortized Computational Complexity
cites work: A lower bound for randomized list update algorithms
description: scientific article; zbMATH DE number 626300