Off-line algorithms for the list update problem
type: Item
instance of: scholarly article
title: Off-line algorithms for the list update problem
zbMATH Open document ID: 0875.68546
DOI: 10.1016/S0020-0190(96)00144-5
author: Nick Reingold
author: Jeffery R. Westbrook
published in: Information Processing Letters
publication date: 1997-02-27T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 984204
zbMATH Keywords: Sequential search
zbMATH Keywords: List updat
zbMATH Keywords: On-line algorithms
zbMATH Keywords: Off-line algorithms
zbMATH Keywords: Competitive analysis
zbMATH Keywords: Analysis of algorithms
MaRDI profile type: Publication
cites work: Q4886073
cites work: On a model for storage and search
cites work: Self-organizing sequential search and Hilbert's inequalities
cites work: An Account of Self-Organizing Systems
cites work: Two results on the list update problem
cites work: Generation of Permutations by Adjacent Transposition
cites work: On Serial Files with Relocatable Records
cites work: Q4144192
cites work: Randomized competitive algorithms for the list update problem
cites work: On self-organizing sequential search heuristics
cites work: Q3726126
cites work: A lower bound for randomized list update algorithms
full work available at URL: s0020-0190(96)00144-5
OpenAlex ID: W2093003283
description: scientific article; zbMATH DE number 984204