The Move-to-Front Rule for Multiple Lists

DOI10.1017/S0269964800001431MaRDI QIDQ3415956zbMATH OpenFDO

Authors Costas Courcoubetis, Richard Weber

Publication date 19 January 2007

Published in Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0269964800001431

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS
• On the competitiveness of the move-to-front rule
• On some multi-request move-to-front heuristics
• scientific article; zbMATH DE number 903457
• Limiting behavior of the search cost distribution for the move-to-front rule in the stable case

Cites work

• A counterexample to a conjecture on optimal list ordering
• On self-organizing sequential search heuristics

Cited in

(12)

• On the competitiveness of the move-to-front rule
• An exact formula for the move-to-front rule for self-organizing lists
• scientific article; zbMATH DE number 3888923 (Why is no real title available?)
• scientific article; zbMATH DE number 3856448 (Why is no real title available?)
• scientific article; zbMATH DE number 4155864 (Why is no real title available?)
• Optimal Space Distributed Order-Preserving Lists
• On some multi-request move-to-front heuristics
• ON A CONJECTURE OF FILL AND HOLST INVOLVING THE MOVE-TO-FRONT RULE AND CACHE FAULTS
• MOVE-TO-FRONT RULE FOR ACCESSING SEVERAL RECORDS
• A Transposition Rule Analysis Based on a Particle Process
• An optimal absorbing list organization strategy with constant memory requirements
• Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: The Move-to-Front Rule for Multiple Lists

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415956)