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

DOI10.1080/07362999608809426MaRDI QIDQ4882951zbMATH OpenOpenAlexFDO

Authors 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 chainself-organizing rulestationary distribution

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)

Recommendations

• On the Markov chain for the move-to-root rule for binary search trees
• Rates of convergence for the move-to-root Markov chain for binary search trees
• scientific article; zbMATH DE number 2102775
• scientific article; zbMATH DE number 795110
• scientific article; zbMATH DE number 2127725

Cites work

• Heuristics That Dynamically Organize Data Structures
• scientific article; zbMATH DE number 53861 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 795110 (Why is no real title available?)
• On the matrix occurring in a linear search problem
• Optimality of move-to-front for self-organizing data structures with locality of references
• Self-adjusting binary search trees
• Self-Organizing Binary Search Trees
• Self-organizing files with dependent accesses
• The performance of the move-to-front scheme under some particular forms of Markov requests

Cited in

(9)

• Optimality of move-to-front for self-organizing data structures with locality of references
• On the Markov chain for the move-to-root rule for binary search trees
• Rates of convergence for the move-to-root Markov chain for binary search trees
• A Markov chain model for dynamic binary search tree behaviour
• Self-organizing files with dependent accesses
• The move-to-partner rule for self-organizing task allocation on a linear array
• scientific article; zbMATH DE number 2102775 (Why is no real title available?)
• scientific article; zbMATH DE number 795110 (Why is no real title available?)
• Efficient reorganization of binary search trees

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

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