Ralph Neininger

ORCID

Publication Activity (10 Years)

Years Active: 1999-2022
Publications (10 Years): 17

Top Venues

CoRR

ANALCO

Random Struct. Algorithms

Comb. Probab. Comput.

University of Freiburg, Freiburg im Breisgau, Germany (PHD)

Education History

University of Freiburg, Freiburg im Breisgau, Germany

PHD

Publications

Julian Gerstenberg, Ralph Neininger, Denis Spiegel
On solutions of the distributional Bellman equation. CoRR (2022)
Ralph Neininger, Jasmin Straub
On the Contraction Method with Reduced Independence Assumptions. AofA (2022)
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58 (3) (2021)
Michael Fuchs, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. Discret. Appl. Math. 292 (2021)
Ralph Neininger, Jasmin Straub
Convergence Rates in the Probabilistic Analysis of Algorithms. AofA (2020)
Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc
Preface. Comb. Probab. Comput. 28 (4) (2019)
Ralph Neininger, Jasmin Straub
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ANALCO (2018)
Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
-ary search trees. Random Struct. Algorithms 50 (3) (2017)
Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO (2017)
Ralph Neininger, Jasmin Straub
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". CoRR (2017)
Andrea Kuntschik, Ralph Neininger
Rates of convergence for balanced irreducible two-color Pólya urns. ANALCO (2017)
Noela S. Müller, Ralph Neininger
The CLT Analogue for Cyclic Urns. ANALCO (2016)
Kevin Leckey, Ralph Neininger, Henning Sulzbach
Process convergence for the complexity of Radix Selection on Markov sources. CoRR (2016)
Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
A Limit Theorem for Radix Sort and Tries with Markovian Input. CoRR (2015)
Noela S. Müller, Ralph Neininger
The CLT Analogue for Cyclic Urns. CoRR (2015)
Ralph Neininger
Refined quicksort asymptotics. Random Struct. Algorithms 46 (2) (2015)
Sebastian Wild, Markus E. Nebel, Ralph Neininger
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms 11 (3) (2015)
Benjamin Dadoun, Ralph Neininger
A statistical view on exchanges in Quickselect. ANALCO (2014)
Margarete Knape, Ralph Neininger
Pólya Urns Via the Contraction Method. Comb. Probab. Comput. 23 (6) (2014)
Benjamin Dadoun, Ralph Neininger
A statistical view on exchanges in Quickselect. CoRR (2013)
Kevin Leckey, Ralph Neininger
Asymptotic Analysis of Hoppe Trees. J. Appl. Probab. 50 (1) (2013)
Ralph Neininger, Kevin Leckey, Wojciech Szpankowski
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model. SODA (2013)
Sebastian Wild, Markus E. Nebel, Ralph Neininger
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort CoRR (2013)
Ralph Neininger, Henning Sulzbach
On a functional contraction method CoRR (2012)
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
A limit process for partial match queries in random quadtrees CoRR (2012)
Kevin Leckey, Ralph Neininger
Asymptotic analysis of Hoppe trees CoRR (2012)
Kevin Leckey, Ralph Neininger, Wojciech Szpankowski
Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model CoRR (2012)
Ralph Neininger
A refined Quicksort asymptotic CoRR (2012)
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
Partial match queries in random quadtrees. SODA (2012)
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
Partial match queries in random quadtrees CoRR (2011)
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees. Algorithmica 46 (3-4) (2006)
Luc Devroye, Ralph Neininger
Distances and Finger Search in Random Binary Search Trees. SIAM J. Comput. 33 (3) (2004)
Luc Devroye, Ralph Neininger
Random suffix search trees. Random Struct. Algorithms 23 (4) (2003)
Ralph Neininger
The Wiener Index Of Random Trees. Comb. Probab. Comput. 11 (6) (2002)
Hsien-Kuei Hwang, Ralph Neininger
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. SIAM J. Comput. 31 (6) (2002)
Ralph Neininger, Ludger Rüschendorf
Rates of convergence for Quicksort. J. Algorithms 44 (1) (2002)
Ralph Neininger
On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Struct. Algorithms 19 (3-4) (2001)
Luc Devroye, James Allen Fill, Ralph Neininger
Perfect simulation from the Quicksort limit distribution CoRR (2000)
Ralph Neininger
Asymptotic distributions for partial match queries in K-d trees. Random Struct. Algorithms 17 (3-4) (2000)
Ralph Neininger, Ludger Rüschendorf
On the internal path length of d-dimensional quad trees. Random Struct. Algorithms 15 (1) (1999)

Ralph Neininger.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ralph Neininger