An optimal absorbing list organization strategy with constant memory requirements

DOI10.1016/0304-3975(93)90166-QzbMath0781.68043OpenAlexW2009308521WikidataQ60328210 ScholiaQ60328210MaRDI QIDQ688166

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)

Cites Work

• Unnamed Item
• Deterministic optimal and expedient move-to-rear list organizing strategies
• List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
• Exegesis of Self-Organizing Linear Search

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