List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations

DOI10.1137/0216047MaRDI QIDQ3801086zbMATH OpenOpenAlexDBLPWikidataFDO

Authors B. John Oommen, Eldon R. Hansen

Publication date 1987

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0216047

zbMATH Keywords

adaptive learningdynamic list orderingmove-to-front algorithmmove-to-rearself-organizing listsstochastic list operations

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20)

Recommendations

• Deterministic optimal and expedient move-to-rear list organizing strategies
• An optimal absorbing list organization strategy with constant memory requirements
• Self-organizing lists and independent references: A statistical synergy
• scientific article; zbMATH DE number 4155864
• On the limited utility of auxiliary information in the list update problem

Cited in

(8)

• An exact formula for the move-to-front rule for self-organizing lists
• The Application of Restricted Counter Schemes to Three Models of Linear Search
• scientific article; zbMATH DE number 4155864 (Why is no real title available?)
• On the limited utility of auxiliary information in the list update problem
• scientific article; zbMATH DE number 480526 (Why is no real title available?)
• An optimal absorbing list organization strategy with constant memory requirements
• Deterministic optimal and expedient move-to-rear list organizing strategies
• Stochastic rearrangement rules for self-organizing data structures

This page was built for publication: List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations

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