An optimal absorbing list organization strategy with constant memory requirements

DOI10.1016/0304-3975(93)90166-QMaRDI QIDQ688166zbMATH OpenOpenAlexWikidataFDO

Authors B. John Oommen, David T. H. Ng

Publication date 9 February 1994

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(93)90166-q

zbMATH Keywords

self-organizing listsadaptive data reorganizationadaptive data structures

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Deterministic optimal and expedient move-to-rear list organizing strategies
• List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
• scientific article; zbMATH DE number 4155864
• Self-organizing lists and independent references: A statistical synergy
• The Move-to-Front Rule for Multiple Lists

Cites work

• scientific article; zbMATH DE number 3519671 (Why is no real title available?)
• Deterministic optimal and expedient move-to-rear list organizing strategies
• Exegesis of Self-Organizing Linear Search
• List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations

Cited in

(6)

• Deterministic optimal and expedient move-to-rear list organizing strategies
• scientific article; zbMATH DE number 4155864 (Why is no real title available?)
• Self-Organizing Doubly-Linked Lists
• On the optimality of the counter-scheme for dynamic linear lists
• List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
• On the limited utility of auxiliary information in the list update problem

This page was built for publication: An optimal absorbing list organization strategy with constant memory requirements

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