Optimality of move-to-front for self-organizing data structures with locality of references

DOI10.1214/aoap/1177005280zbMath0799.68052OpenAlexW1972343404MaRDI QIDQ1313079

Philippe Chassaing

Publication date: 7 February 1994

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

Full work available at URL: https://doi.org/10.1214/aoap/1177005280

zbMATH Keywords

localitysequential searchcontrolled Markov chainBellman optimality conditionself-organizing data structure

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Markov and semi-Markov decision processes (90C40) Data structures (68P05)

Related Items (4)

Determining the majority: The biased case ⋮ The move-to-root rule for self-organizing trees with Markov dependent requests^∗ ⋮ Markov incremental constructions ⋮ Data structures on event graphs

This page was built for publication: Optimality of move-to-front for self-organizing data structures with locality of references