On the contraction method with degenerate limit equation
暂无分享,去创建一个
[1] L. Rüschendorf,et al. A general limit theorem for recursive algorithms and combinatorial structures , 2004 .
[2] Ludger Rüschendorf,et al. Analysis of recursive algorithms by the contraction method , 1996 .
[3] Uwe Rr Osler. The Contraction Method for Recursive Algorithms , 1999 .
[4] Hosam M. Mahmoud,et al. Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.
[5] Jim Freeman. Probability Metrics and the Stability of Stochastic Models , 1991 .
[6] U. Rösler. A fixed point theorem for distributions , 1992 .
[7] V. Zolotarev. Ideal Metrics in the Problem of Approximating Distributions of Sums of Independent Random Variables , 1978 .
[8] V. Zolotarev. Approximation of Distributions of Sums of Independent Random Variables with Values in Infinite-Dimensional Spaces , 1977 .
[9] Wojciech Szpankowski,et al. On the distribution for the duration of a randomized leader election algorithm , 1996 .
[10] Hsien-Kuei Hwang,et al. Quickselect and the Dickman Function , 2002, Combinatorics, Probability and Computing.
[11] Helmut Prodinger,et al. How to select a loser , 1993, Discret. Math..
[12] Hosam M. Mahmoud,et al. Distribution of distances in random binary search trees , 2003 .
[13] U. Rösler. A limit theorem for "Quicksort" , 1991, RAIRO Theor. Informatics Appl..
[14] S. Rachev,et al. Probability metrics and recursive algorithms , 1995, Advances in Applied Probability.
[15] Ludger Rüschendorf,et al. Rates of convergence for Quicksort , 2002, J. Algorithms.
[16] Hsien-Kuei Hwang,et al. Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model , 2003, J. Algorithms.