The move-to-root rule for self-organizing trees with Markov dependent requests∗

DOI10.1080/07362999608809426zbMath0848.60071OpenAlexW4238765538MaRDI QIDQ4882951

Robert P. Dobrow

Publication date: 21 October 1996

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362999608809426

zbMATH Keywords

Markov chainstationary distributionself-organizing rule

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality of move-to-front for self-organizing data structures with locality of references
• Self-organizing files with dependent accesses
• On the matrix occurring in a linear search problem
• Self-adjusting binary search trees
• Self-Organizing Binary Search Trees
• Heuristics That Dynamically Organize Data Structures
• The performance of the move-to-front scheme under some particular forms of Markov requests

This page was built for publication: The move-to-root rule for self-organizing trees with Markov dependent requests^∗