Off-line algorithms for the list update problem

DOI10.1016/S0020-0190(96)00144-5zbMath0875.68546OpenAlexW2093003283MaRDI QIDQ1350929

Jeffery Westbrook, Nick Reingold

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00144-5

zbMATH Keywords

Competitive analysisOn-line algorithmsAnalysis of algorithmsList updatOff-line algorithmsSequential search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

The list update problem and the retrieval of sets, Revisiting the COUNTER algorithms for list update, Paid exchanges are worth the price, Self-adjusting grid networks, On the list update problem with advice, The list update problem and the retrieval of sets, A new lower bound for the list update problem in the partial cost model, A Survey of Algorithms and Models for List Update, On list update and work function algorithms., Randomized competitive algorithms for the list update problem, Parameterized analysis of paging and list update algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A lower bound for randomized list update algorithms
• Self-organizing sequential search and Hilbert's inequalities
• Two results on the list update problem
• Randomized competitive algorithms for the list update problem
• On self-organizing sequential search heuristics
• An Account of Self-Organizing Systems
• On a model for storage and search
• On Serial Files with Relocatable Records
• Generation of Permutations by Adjacent Transposition