On lookahead in the list update problem

DOI10.1016/0020-0190(94)00014-XzbMath0803.68022OpenAlexW2067472350MaRDI QIDQ1322123

Amitava Majumdar, Rahul Simha

Publication date: 2 January 1995

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00014-x

zbMATH Keywords

self-adjusting data structureslist updatelistsmove-to-front algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Unnamed Item
• Self-organizing sequential search and Hilbert's inequalities
• Competitive algorithms for server problems
• Exegesis of Self-Organizing Linear Search
• On the limited utility of auxiliary information in the list update problem
• Self-Organizing Doubly-Linked Lists
• On self-organizing sequential search heuristics
• Heuristics That Dynamically Organize Data Structures
• On a model for storage and search
• An extension of a theorem concerning an interesting Markov chain
• On Serial Files with Relocatable Records

This page was built for publication: On lookahead in the list update problem