scientific article; zbMATH DE number 795110

MaRDI QIDQ4845259zbMATH OpenFDO

Authors Robert P. Dobrow, James Allen Fill

Publication date 26 November 1995

zbMATH Keywords

Markov chaincouplingseparationstationary distributiontotal variation distanceconvergence to stationaritymove-to-front ruleself-organizing search

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• An exact formula for the move-to-front rule for self-organizing lists
• Performance of the move-to-front algorithm with Markov-modulated request sequences
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• scientific article; zbMATH DE number 2102775
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule

Cited in

(21)

• Performance of the move-to-front algorithm with Markov-modulated request sequences
• Self-organizing sequential search and Hilbert's inequalities
• scientific article; zbMATH DE number 480526 (Why is no real title available?)
• Random walks and hyperplane arrangements
• scientific article; zbMATH DE number 3856448 (Why is no real title available?)
• Perron eigenvector of the Tsetlin matrix
• Self-organizing files with dependent accesses
• An exact formula for the move-to-front rule for self-organizing lists
• The move-to-root rule for self-organizing trees with Markov dependent requests^∗
• On the asymptotics of fault probability in least-recently-used caching with Zipf-type request distribution
• Least-recently-used caching with dependent requests
• Optimality of move-to-front for self-organizing data structures with locality of references
• Geometric ergodicity and the spectral gap of non-reversible Markov chains
• On the Markov chain for the move-to-root rule for binary search trees
• scientific article; zbMATH DE number 2102775 (Why is no real title available?)
• Functions of random walks on hyperplane arrangements
• Rates of convergence for the move-to-root Markov chain for binary search trees
• Enumerative theory for the Tsetlin library
• Self-organizing lists and independent references: A statistical synergy
• The move-to-partner rule for self-organizing task allocation on a linear array
• Comparison of subdominant eigenvalues of some linear search schemes

This page was built for publication:

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