论文信息 - Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees - 字舞流文

Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees

James Allen Fill | Robert P. Dobrow | J. A. Fill | R. Dobrow

[1] P. Diaconis,et al. SHUFFLING CARDS AND STOPPING-TIMES , 1986 .

[2] P. Diaconis,et al. Strong Stationary Times Via a New Form of Duality , 1990 .

[3] James Allen Fill,et al. On the Markov Chain for the Move-to-Root Rule for Binary Search Trees , 1995 .

[4] J. Ian Munro,et al. Self-organizing binary search trees , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[5] Eugene S. Schwartz,et al. A Dictionary for Minimum Redundancy Encoding , 1963, JACM.

[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[7] P. Diaconis,et al. Strong uniform times and finite random walks , 1987 .