Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Mahmoud, Hosam M.
1992.
Distances in random plane-oriented recursive trees.
Journal of Computational and Applied Mathematics,
Vol. 41,
Issue. 1-2,
p.
237.
Mahmoud, Hosam M.
and
Smythe, Robert T.
1995.
Probabilistic analysis of bucket recursive trees.
Theoretical Computer Science,
Vol. 144,
Issue. 1-2,
p.
221.
Dobrow, Robert P.
1996.
On the distribution of distances in recursive trees.
Journal of Applied Probability,
Vol. 33,
Issue. 03,
p.
749.
Dobrow, Robert P.
1996.
On the distribution of distances in recursive trees.
Journal of Applied Probability,
Vol. 33,
Issue. 3,
p.
749.
Tsukiji, Tatsuie
and
Xhafa, Fatos
1996.
Algorithms — ESA '96.
Vol. 1136,
Issue. ,
p.
208.
2000.
Sorting.
p.
373.
Rösler, U.
and
Rüschendorf, L.
2001.
The contraction method for recursive algorithms.
Algorithmica,
Vol. 29,
Issue. 1-2,
p.
3.
Devroye, Luc
and
Neininger, Ralph
2002.
Density approximation and exact simulation of random variables that are solutions of fixed-point equations.
Advances in Applied Probability,
Vol. 34,
Issue. 2,
p.
441.
Devroye, Luc
and
Neininger, Ralph
2002.
Density approximation and exact simulation of random variables that are solutions of fixed-point equations.
Advances in Applied Probability,
Vol. 34,
Issue. 2,
p.
441.
Hwang, Hsien-Kuei
and
Neininger, Ralph
2002.
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions.
SIAM Journal on Computing,
Vol. 31,
Issue. 6,
p.
1687.
Goh, William
and
Schmutz, Eric
2002.
Limit distribution for the maximum degree of a random recursive tree.
Journal of Computational and Applied Mathematics,
Vol. 142,
Issue. 1,
p.
61.
Panholzer, Alois
2004.
The distribution of the size of the ancestor‐tree and of the induced spanning subtree for random trees.
Random Structures & Algorithms,
Vol. 25,
Issue. 2,
p.
179.
Drmota, Michael
and
Hwang, Hsien-Kuei
2005.
Profiles of random trees: correlation and width of random recursive trees and binary search trees.
Advances in Applied Probability,
Vol. 37,
Issue. 2,
p.
321.
Drmota, Michael
and
Hwang, Hsien-Kuei
2005.
Profiles of random trees: correlation and width of random recursive trees and binary search trees.
Advances in Applied Probability,
Vol. 37,
Issue. 02,
p.
321.
Sun, Yong
and
Wang, Xuan
2006.
General Solution Scheme to Spatial Complexity of Recursive Algorithm.
p.
952.
Chen, Wei-Mei
2006.
Cost distribution of the Chang–Roberts leader election algorithm and related problems.
Theoretical Computer Science,
Vol. 369,
Issue. 1-3,
p.
442.
Su, Chun
Liu, Jie
and
Feng, Qunqiang
2006.
A note on the distance in random recursive trees.
Statistics & Probability Letters,
Vol. 76,
Issue. 16,
p.
1748.
Su, Chun
Feng, Qunqiang
and
Hu, Zhishui
2006.
Uniform recursive trees: Branching structure and simple random downward walk.
Journal of Mathematical Analysis and Applications,
Vol. 315,
Issue. 1,
p.
225.
Panholzer, Alois
and
Prodinger, Helmut
2007.
Level of nodes in increasing trees revisited.
Random Structures & Algorithms,
Vol. 31,
Issue. 2,
p.
203.
Feng, Qunqiang
and
Su, Chun
2007.
The structure and distances in Yule recursive trees.
Random Structures & Algorithms,
Vol. 31,
Issue. 3,
p.
273.