A general limit theorem for recursive algorithms and combinatorial structures R Neininger, L Rüschendorf The Annals of Applied Probability 14 (1), 378-418, 2004 | 174 | 2004 |

Phase change of limit laws in the quicksort recurrence under varying toll functions HK Hwang, R Neininger SIAM Journal on Computing 31 (6), 1687-1722, 2002 | 100 | 2002 |

On a multivariate contraction method for random recursive structures with applications to Quicksort R Neininger Random Structures & Algorithms 19 (3‐4), 498-524, 2001 | 79 | 2001 |

Profiles of random trees: Limit theorems for random recursive trees and binary search trees M Fuchs, HK Hwang, R Neininger Algorithmica 46 (3), 367-407, 2006 | 75 | 2006 |

The Wiener index of random trees R Neininger Combinatorics, Probability and Computing 11 (6), 587-597, 2002 | 63 | 2002 |

A functional limit theorem for the profile of search trees M Drmota, S Janson, R Neininger The Annals of Applied Probability 18 (1), 288-333, 2008 | 57 | 2008 |

On the contraction method with degenerate limit equation R Neininger, L Rüschendorf The Annals of Probability 32 (3B), 2838-2856, 2004 | 54 | 2004 |

Distribution of distances in random binary search trees HM Mahmoud, R Neininger The Annals of Applied Probability 13 (1), 253-276, 2003 | 51 | 2003 |

A multiple filter test for the detection of rate changes in renewal processes with varying variance M Messer, M Kirchner, J Schiemann, J Roeper, R Neininger, G Schneider The Annals of Applied Statistics 8 (4), 2027-2067, 2014 | 42 | 2014 |

Pólya urns via the contraction method M Knape, R Neininger Combinatorics, Probability and Computing 23 (6), 1148-1186, 2014 | 39 | 2014 |

On the internal path length of *d*‐dimensional quad treesR Neininger, L Rüschendorf Random Structures & Algorithms 15 (1), 25-41, 1999 | 38 | 1999 |

On the length distribution of external branches in coalescence trees: genetic diversity within species A Caliebe, R Neininger, M Krawczak, U Rösler Theoretical population biology 72 (2), 245-252, 2007 | 36 | 2007 |

Average case and distributional analysis of dual-pivot quicksort S Wild, ME Nebel, R Neininger ACM Transactions on Algorithms (TALG) 11 (3), 1-42, 2015 | 32 | 2015 |

The size of random fragmentation trees S Janson, R Neininger Probability theory and related fields 142 (3), 399-442, 2008 | 31 | 2008 |

Density approximation and exact simulation of random variables that are solutions of fixed-point equations L Devroye, R Neininger Advances in Applied Probability 34 (2), 441-468, 2002 | 30 | 2002 |

On a functional contraction method R Neininger, H Sulzbach The Annals of Probability 43 (4), 1777-1822, 2015 | 28 | 2015 |

A survey of multivariate aspects of the contraction method L Rüschendorf, R Neininger Discrete Mathematics & Theoretical Computer Science 8, 2006 | 27 | 2006 |

Distances and finger search in random binary search trees L Devroye, R Neininger SIAM Journal on Computing 33 (3), 647-658, 2004 | 27 | 2004 |

Analysis of algorithms by the contraction method: additive and max-recursive sequences R Neininger, L Rüschendorf Interacting stochastic systems, 435-450, 2005 | 26 | 2005 |

Refined quicksort asymptotics R Neininger Random Structures & Algorithms 46 (2), 346-361, 2015 | 25 | 2015 |