Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Open Access
- 10 September 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 164 (1-2) , 185-206
- https://doi.org/10.1016/0304-3975(95)00210-3
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the distribution of search cost for the move-to-front ruleRandom Structures & Algorithms, 1996
- An exact formula for the move-to-front rule for self-organizing listsJournal of Theoretical Probability, 1996
- On the transition probabilities of the move-to-front schemeJournal of Applied Probability, 1994
- Birthday paradox, coupon collectors, caching algorithms and self-organizing searchDiscrete Applied Mathematics, 1992
- Strong uniform times and finite random walksAdvances in Applied Mathematics, 1987
- Shuffling Cards and Stopping TimesThe American Mathematical Monthly, 1986
- Self-organizing linear searchACM Computing Surveys, 1985
- Heuristics That Dynamically Organize Data StructuresSIAM Journal on Computing, 1979
- The stationary distribution of an interesting Markov chainJournal of Applied Probability, 1972
- On Serial Files with Relocatable RecordsOperations Research, 1965