Ralph Neininger

发表

Limit laws for random recursive structures and algorithms

Ralph Neininger, Ralph Neininger, 1999 .

Average Case and Distributional Analysis of Dual-Pivot Quicksort

Sebastian Wild, Ralph Neininger, Markus E. Nebel, 2013, ACM Trans. Algorithms.

Partial match queries in random quadtrees pdf

Nicolas Broutin, Henning Sulzbach, Ralph Neininger, 2011, SODA.

The CLT Analogue for Cyclic Urns pdf

Ralph Neininger, Noela S. Müller, 2016, ANALCO.

On a multivariate contraction method for random recursive structures with applications to Quicksort

Ralph Neininger, 2001, Random Struct. Algorithms.

Detection and localization of multiple rate changes in Poisson spike trains

Ralph Neininger, Jochen Roeper, Gaby Schneider, 2011, BMC Neuroscience.

Process convergence for the complexity of Radix Selection on Markov sources pdf

Henning Sulzbach, Ralph Neininger, Kevin Leckey, 2016, Stochastic Processes and their Applications.

A limit process for partial match queries in random quadtrees pdf

Nicolas Broutin, Henning Sulzbach, Ralph Neininger, 2012, ArXiv.

On a functional contraction method pdf

Henning Sulzbach, Ralph Neininger, Henning Sulzbach, 2012, ArXiv.

A multiple filter test for change point detection in renewal processes with varying variance

Ralph Neininger, Jochen Roeper, Gaby Schneider, 2013 .

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort pdf

Sebastian Wild, Ralph Neininger, Markus E. Nebel, 2013, ArXiv.

The Wiener Index Of Random Trees

Ralph Neininger, 2002, Comb. Probab. Comput..

Dependence and phase changes in random m-ary search trees

Hsien-Kuei Hwang, Ralph Neininger, Michael Fuchs, 2017, Random Struct. Algorithms.

Asymptotic distributions for partial match queries in K-d trees

Ralph Neininger, 2000, Random Struct. Algorithms.

Random suffix search trees

Luc Devroye, Ralph Neininger, L. Devroye, 2003, Random Struct. Algorithms.

Pólya Urns Via the Contraction Method

Ralph Neininger, Margarete Knape, Margarete Knape, 2013, Combinatorics, Probability and Computing.

A statistical view on exchanges in Quickselect pdf

Ralph Neininger, Benjamin Dadoun, 2014, ANALCO.

Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

Hsien-Kuei Hwang, Ralph Neininger, Hsien-Kuei Hwang, 2002, SIAM J. Comput..

Asymptotic Analysis of Hoppe Trees

Ralph Neininger, Kevin Leckey, Kevin Leckey, 2012, Journal of Applied Probability.

On the internal path length of d-dimensional quad trees

Ludger Rüschendorf, Ralph Neininger, 1999, Random Struct. Algorithms.

Refined quicksort asymptotics

Ralph Neininger, Ralph Neininger, 2012, Random Struct. Algorithms.

Convergence Rates in the Probabilistic Analysis of Algorithms

Ralph Neininger, Jasmin Straub, 2020, AofA.

Perfect simulation from the Quicksort limit distribution

Luc Devroye, James Allen Fill, Ralph Neininger, 2000, ArXiv.

Rates of convergence for Quicksort

Ludger Rüschendorf, Ralph Neininger, L. Rüschendorf, 2002, J. Algorithms.

External Profile of Symmetric Digital Search Trees (Extended Abstract)

Michael Drmota, Hsien-Kuei Hwang, Ralph Neininger, 2017, ANALCO.

Preface

Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc, 2019, Combinatorics, Probability and Computing.

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees

Hsien-Kuei Hwang, Ralph Neininger, Michael Fuchs, 2006, Algorithmica.

A refined Quicksort asymptotic pdf

Ralph Neininger, 2012, ArXiv.

A Limit Theorem for Radix Sort and Tries with Markovian Input pdf

Wojciech Szpankowski, Ralph Neininger, Kevin Leckey, 2015, ArXiv.

Rates of convergence for balanced irreducible two-color Pólya urns

Ralph Neininger, Andrea Kuntschik, Ralph Neininger, 2017, ANALCO.

Detection and localization of multiple rate changes in Poisson spike trains : poster presentation from Twentieth Annual Computational Neuroscience Meeting CNS*2011 Stockholm, Sweden, 23 - 28 July 2011

Ralph Neininger, Jochen Roeper, Gaby Schneider, 2011 .

Probabilistic Analysis of the Dual-Pivot Quicksort "Count"

Ralph Neininger, Jasmin Straub, 2018, ANALCO.

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model pdf

Wojciech Szpankowski, Ralph Neininger, Kevin Leckey, 2012, SODA.

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

Dieter Mitsche, Ralph Neininger, Cecilia Holmgren, 2019, Discrete Applied Mathematics.

Node profiles of symmetric digital search trees: Concentration properties

Michael Drmota, Hsien-Kuei Hwang, Ralph Neininger, 2017, Random Struct. Algorithms.

Distances and Finger Search in Random Binary Search Trees

Luc Devroye, Ralph Neininger, L. Devroye, 2004, SIAM J. Comput..

Tail Bounds for the Wiener Index of Random Trees

Ralph Neininger, Tämur Ali Khan, 2008 .

A Gaussian limit process for optimal FIND algorithms

Michael Drmota, Henning Sulzbach, Ralph Neininger, 2013, 1307.5218.

On the contraction method with degenerate limit equation

Ralph Neininger, Ludger Ruschendorf, R. Neininger, 2004 .

Analysis of radix selection on Markov sources

Henning Sulzbach, Ralph Neininger, Kevin Leckey, 2014, 1404.3672.

A multiple filter test for the detection of rate changes in renewal processes with varying variance

Ralph Neininger, Jochen Roeper, Gaby Schneider, 2013, 1303.3594.

On the internal path length of d -dimensional quad trees

Ludger Rüschendorf, Ralph Neininger, 1999 .