On the optimality of the counter-scheme for dynamic linear lists

DOI10.1016/0020-0190(91)90040-OzbMath0714.68040OpenAlexW2087748288WikidataQ126557540 ScholiaQ126557540MaRDI QIDQ751280

Micha Hofri, Hadas Shachnai

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90040-o

zbMATH Keywords

analysis of algorithmsoptimal policyindependent reference modellistsreorganizations

Mathematics Subject Classification ID

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

Related Items (2)

On the distribution of the search cost for the move-to-front rule with random weights ⋮ The Application of Restricted Counter Schemes to Three Models of Linear Search

Cites Work

• A generalized counter scheme
• Reordering heuristics for routing in communications networks
• Self-organizing lists and independent references: A statistical synergy
• On self-organizing sequential search heuristics

This page was built for publication: On the optimality of the counter-scheme for dynamic linear lists