Limits and rates of convergence for the distribution of search cost under the move-to-front rule

Theoretical Computer Science

Volumn 164, Issue 1-2, 1996, Pages 185-206

  Fill, James Allen ^a  

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; MARKOV PROCESSES; MATHEMATICAL MODELS; ONLINE SEARCHING; PROBABILITY; SELF ORGANIZING STORAGE;

GEOMETRIC WEIGHTS; LOWER BOUNDS; MOVE TO FRONT RULE; SEARCH COST DISTRIBUTION; SELF ORGANIZING LISTS; UPPER BOUNDS; ZIPF LAW;

INFORMATION THEORY;

EID: 0030246345     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00210-3     Document Type: Article

References (18)

1. D. Aldous and P. Diaconis, Shuffling cards and stopping times, Amer. Math. Monthly 93 (1986) 333-348.
2. D. Aldous and P. Diaconis, Strong uniform times and finite random walks, Ad. Appl. Math. 8 (1987) 69-97.
3. R.G. Bartle, The Elements of Real Analysis (Wiley, New York, 1964).
4. J.R. Bitner, Heuristics that dynamically organize data structures, SIAM J. Comput. 8 (1979) 82-110.
5. K.L. Chung, A Course in Probability Theory (Academic Press, New York, 2nd ed., 1974).
6. P. Diaconis, Group Representations in Probability and Statistics (Institute of Mathematical Statistics, Hayward, CA, 1988).
7. P. Diaconis, Analysis of some weighted mixing schemes, unpublished manuscript, 1993.
8. R.P. Dobrow and J.A. Fill, Rates of convergence for the move-to-root Markov chain for binary search trees, Ann. Appl. Probab. 5 (1995) 20-36.
9. R.M. Dudley, Real Analysis and Probability (Wadsworth & Brooks/Cole, Pacific Grove, CA, 1989).
10. J.A. Fill, An exact formula for the move-to-front rule for self-organizing lists, J. Theoret. Probab. (1996) to appear.
11. J.A. Fill and L. Holst, On the distribution of search cost for the move-to-front rule, Random Structures and Algorithms 8 (1996) to appear.
12. P. Flajolet, D. Gardy and L. Thimonier, Birthday paradox, coupon collectors, caching algorithms and self-organizing search, Discrete Appl. Math. 39 (1992) 207-229.
13. W.J. Hendricks, The stationary distribution of an interesting Markov chain, J. Appl. Probab. 9 (1972) 231-233.
14. J.H. Hester and D.S. Hirschberg, Self-organizing linear search, Comput. Surv. 17 (1985) 295-311.
15. W.C. King, Analysis of paging algorithms, in: Proc. IFIP 1971 Congr., Ljubljana, (North-Holland, Amsterdam, 1972) 485-490.
16. J. McCabe, On serial files with relocatable records, Oper. Res. 13 (1965) 609-618.
17. R.M. Phatarfod, On the transition probabilities of move to front scheme, J. Appl. Probab. 31 (1994) 570-574.
18. A. Sinclair, Algorithms for Random Generation and Counting: A Markov Chain Approach (Birkhäuser, Boston, 1993).