scientific article; zbMATH DE number 795110

zbMATH Open0827.60054MaRDI QIDQ4845259FDOQ4845259

Authors: Robert P. Dobrow, James Allen Fill 

Publication date: 26 November 1995

Title of this publication is not available (Why is that?)

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

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)

Cited In (21)

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

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)