A counterexample to a conjecture on optimal list ordering

DOI10.2307/3213536zbMATH Open0488.60096OpenAlexW4252079428MaRDI QIDQ3949784FDOQ3949784

Authors: Peter Nash, Edward J. Anderson, Richard Weber 

Publication date: 1982

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213536

zbMATH Keywords

memory constraintstransposition ruleoptimal list order

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Inventory, storage, reservoirs (90B05)

Cited In (4)

• A Transposition Rule Analysis Based on a Particle Process
• Self-organizing sequential search and Hilbert's inequalities
• The Move-to-Front Rule for Multiple Lists
• Processor Reordering Rules

This page was built for publication: A counterexample to a conjecture on optimal list ordering

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