On the internal path length of d-dimensional quad trees. - Ralph Neininger; Ludger Rüschendorf (Random Struct. Algorithms, 1999)

Limit laws for random recursive structures and algorithms. - Ralph Neininger (1999)

Perfect simulation from the Quicksort limit distribution - Luc Devroye; James Allen Fill; Ralph Neininger (CoRR, 2000)

Asymptotic distributions for partial match queries in K-d trees. - Ralph Neininger (Random Struct. Algorithms, 2000)

On a multivariate contraction method for random recursive structures with applications to Quicksort. - Ralph Neininger (Random Struct. Algorithms, 2001)

The Wiener Index Of Random Trees. - Ralph Neininger (Comb. Probab. Comput., 2002)

Rates of convergence for Quicksort. - Ralph Neininger; Ludger Rüschendorf (J. Algorithms, 2002)

Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. - Hsien-Kuei Hwang; Ralph Neininger (SIAM J. Comput., 2002)

Random suffix search trees. - Luc Devroye; Ralph Neininger (Random Struct. Algorithms, 2003)

Distances and Finger Search in Random Binary Search Trees. - Luc Devroye; Ralph Neininger (SIAM J. Comput., 2004)

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. - Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Algorithmica, 2006)

Partial match queries in random quadtrees. - Nicolas Broutin; Ralph Neininger; Henning Sulzbach (SODA, 2012)

A limit process for partial match queries in random quadtrees - Nicolas Broutin; Ralph Neininger; Henning Sulzbach (CoRR, 2012)

On a functional contraction method - Ralph Neininger; Henning Sulzbach (CoRR, 2012)

A refined Quicksort asymptotic - Ralph Neininger (CoRR, 2012)

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. - Ralph Neininger; Kevin Leckey; Wojciech Szpankowski (SODA, 2013)

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort - Sebastian Wild; Markus E. Nebel; Ralph Neininger (CoRR, 2013)

Asymptotic Analysis of Hoppe Trees. - Kevin Leckey; Ralph Neininger (J. Appl. Probab., 2013)

A statistical view on exchanges in Quickselect. - Benjamin Dadoun; Ralph Neininger (ANALCO, 2014)

Pólya Urns Via the Contraction Method. - Margarete Knape; Ralph Neininger (Comb. Probab. Comput., 2014)

A Limit Theorem for Radix Sort and Tries with Markovian Input. - Kevin Leckey; Ralph Neininger; Wojciech Szpankowski (CoRR, 2015)

Refined quicksort asymptotics. - Ralph Neininger (Random Struct. Algorithms, 2015)

Average Case and Distributional Analysis of Dual-Pivot Quicksort. - Sebastian Wild; Markus E. Nebel; Ralph Neininger (ACM Trans. Algorithms, 2015)

The CLT Analogue for Cyclic Urns. - Noela S. Müller; Ralph Neininger (ANALCO, 2016)

Process convergence for the complexity of Radix Selection on Markov sources. - Kevin Leckey; Ralph Neininger; Henning Sulzbach (CoRR, 2016)

External Profile of Symmetric Digital Search Trees (Extended Abstract). - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (ANALCO, 2017)

Rates of convergence for balanced irreducible two-color Pólya urns. - Andrea Kuntschik; Ralph Neininger (ANALCO, 2017)

Dependence and phase changes in random m-ary search trees. - Hua-Huai Chern; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Random Struct. Algorithms, 2017)

Probabilistic Analysis of the Dual-Pivot Quicksort "Count". - Ralph Neininger; Jasmin Straub (ANALCO, 2018)

Preface. - Hsien-Kuei Hwang; Ralph Neininger; Marek Zaionc (Comb. Probab. Comput., 2019)

Convergence Rates in the Probabilistic Analysis of Algorithms. - Ralph Neininger; Jasmin Straub (AofA, 2020)

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. - Michael Fuchs 001; Cecilia Holmgren; Dieter Mitsche; Ralph Neininger (Discret. Appl. Math., 2021)

Node profiles of symmetric digital search trees: Concentration properties. - Michael Drmota; Michael Fuchs 001; Hsien-Kuei Hwang; Ralph Neininger (Random Struct. Algorithms, 2021)

On the Contraction Method with Reduced Independence Assumptions. - Ralph Neininger; Jasmin Straub (AofA, 2022)

On solutions of the distributional Bellman equation. - Julian Gerstenberg; Ralph Neininger; Denis Spiegel (CoRR, 2022)

Patricia's Bad Distributions. - Louigi Addario-Berry; Pat Morin; Ralph Neininger (AofA, 2024)

On Fluctuations of Complexity Measures for the FIND Algorithm. - Jasper Ischebeck; Ralph Neininger (AofA, 2024)

On Policy Evaluation Algorithms in Distributional Reinforcement Learning. - Julian Gerstenberg; Ralph Neininger; Denis Spiegel (CoRR, 2024)