Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Neininger, Ralph
2000.
Asymptotic distributions for partial match queries inK-d trees.
Random Structures and Algorithms,
Vol. 17,
Issue. 3-4,
p.
403.
Rösler, U.
and
Rüschendorf, L.
2001.
The contraction method for recursive algorithms.
Algorithmica,
Vol. 29,
Issue. 1-2,
p.
3.
Neininger, Ralph
and
Rüschendorf, Ludger
2001.
Limit laws for partial match queries in quadtrees.
The Annals of Applied Probability,
Vol. 11,
Issue. 2,
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.
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.
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.
Neininger, Ralph
and
Rüschendorf, Ludger
2004.
A general limit theorem for recursive algorithms and combinatorial structures.
The Annals of Applied Probability,
Vol. 14,
Issue. 1,
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. 2,
p.
321.
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.
Feng, Qunqiang
and
Su, Chun
2007.
The structure and distances in Yule recursive trees.
Random Structures & Algorithms,
Vol. 31,
Issue. 3,
p.
273.
Drmota, Michael
Gittenberger, Bernhard
Panholzer, Alois
Prodinger, Helmut
and
Ward, Mark Daniel
2009.
On the shape of the fringe of various types of random trees.
Mathematical Methods in the Applied Sciences,
Vol. 32,
Issue. 10,
p.
1207.
Munsonius, Goetz Olaf
2011.
On the Asymptotic Internal Path Length and the Asymptotic Wiener Index of Random Split Trees.
Electronic Journal of Probability,
Vol. 16,
Issue. none,
Munsonius, Götz Olaf
and
Rüschendorf, Ludger
2011.
Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees.
Journal of Applied Probability,
Vol. 48,
Issue. 4,
p.
1060.
Munsonius, Götz Olaf
and
Rüschendorf, Ludger
2011.
Limit Theorems for Depths and Distances in Weighted Random B-Ary Recursive Trees.
Journal of Applied Probability,
Vol. 48,
Issue. 4,
p.
1060.
Broutin, Nicolas
and
Holmgren, Cecilia
2012.
The total path length of split trees.
The Annals of Applied Probability,
Vol. 22,
Issue. 5,
Devroye, Luc
Fawzi, Omar
and
Fraiman, Nicolas
2012.
Depth Properties of scaled attachment random recursive trees.
Random Structures & Algorithms,
Vol. 41,
Issue. 1,
p.
66.
Leckey, Kevin
and
Neininger, Ralph
2013.
Asymptotic Analysis of Hoppe Trees.
Journal of Applied Probability,
Vol. 50,
Issue. 1,
p.
228.
Leckey, Kevin
and
Neininger, Ralph
2013.
Asymptotic Analysis of Hoppe Trees.
Journal of Applied Probability,
Vol. 50,
Issue. 01,
p.
228.