Deterministic optimal and expedient move-to-rear list organizing strategies

DOI10.1016/0304-3975(90)90136-6zbMath0701.68041OpenAlexW1979556916WikidataQ60328285 ScholiaQ60328285MaRDI QIDQ914378

B. John Oommen, J. Ian Munro, Eldon R. Hansen

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90136-6

zbMATH Keywords

listMove-to-Rearself-organizing strategies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

An optimal absorbing list organization strategy with constant memory requirements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
• Optimal list order under partial memory constraints
• Exegesis of Self-Organizing Linear Search
• Two Spectra of Self-Organizing Sequential Search Algorithms
• On self-organizing sequential search heuristics
• Heuristics That Dynamically Organize Data Structures
• On a model for storage and search
• An extension of a theorem concerning an interesting Markov chain
• On Serial Files with Relocatable Records

This page was built for publication: Deterministic optimal and expedient move-to-rear list organizing strategies