Ralph Neininger - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2026

The analysis of partial match queries in random multidimensional trees: A selected surveyAmalia Duch, Hsien-Kuei Hwang, Conrado Martínez, Ralph Neininger. csr, 61:100904, 2026. [doi]

2024

Patricia's Bad DistributionsLouigi Addario-Berry, Pat Morin, Ralph Neininger. aofa 2024: [doi]

On Fluctuations of Complexity Measures for the FIND AlgorithmJasper Ischebeck, Ralph Neininger. aofa 2024: [doi]

2022

On the Contraction Method with Reduced Independence AssumptionsRalph Neininger, Jasmin Straub. aofa 2022: [doi]

2021

A note on the independence number, domination number and related parameters of random binary search trees and random recursive treesMichael Fuchs 0001, Cecilia Holmgren, Dieter Mitsche, Ralph Neininger. DAM, 292:64-71, 2021. [doi]

Node profiles of symmetric digital search trees: Concentration propertiesMichael Drmota, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger. rsa, 58(3):430-467, 2021. [doi]

2020

Convergence Rates in the Probabilistic Analysis of AlgorithmsRalph Neininger, Jasmin Straub. aofa 2020: [doi]

2019

PrefaceHsien-Kuei Hwang, Ralph Neininger, Marek Zaionc. cpc, 28(4):483-484, 2019. [doi]

2018

Probabilistic Analysis of the Dual-Pivot Quicksort "Count"Ralph Neininger, Jasmin Straub. analco 2018: 1-7 [doi]

2017

m-ary search treesHua-Huai Chern, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger. rsa, 50(3):353-379, 2017. [doi]

External Profile of Symmetric Digital Search Trees (Extended Abstract)Michael Drmota, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger. analco 2017: 124-130 [doi]

Rates of convergence for balanced irreducible two-color Pólya urnsAndrea Kuntschik, Ralph Neininger. analco 2017: 94-99 [doi]

2016

The CLT Analogue for Cyclic UrnsNoela S. Müller, Ralph Neininger. analco 2016: 121-127 [doi]

2015

Refined quicksort asymptoticsRalph Neininger. rsa, 46(2):346-361, 2015. [doi]

Average Case and Distributional Analysis of Dual-Pivot QuicksortSebastian Wild, Markus E. Nebel, Ralph Neininger. TALG, 11(3):22, 2015. [doi]

2014

A statistical view on exchanges in QuickselectBenjamin Dadoun, Ralph Neininger. analco 2014: 40-51 [doi]

Pólya Urns Via the Contraction MethodMargarete Knape, Ralph Neininger. cpc, 23(6):1148-1186, 2014. [doi]

2013

Asymptotic Analysis of Hoppe TreesKevin Leckey, Ralph Neininger. jap, 50(1):228-238, 2013. [doi]

Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov ModelRalph Neininger, Kevin Leckey, Wojciech Szpankowski. soda 2013: 877-886 [doi]

2012

Partial match queries in random quadtreesNicolas Broutin, Ralph Neininger, Henning Sulzbach. soda 2012: 1056-1065 [doi]

2006

Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search TreesMichael Fuchs, Hsien-Kuei Hwang, Ralph Neininger. algorithmica, 46(3-4):367-407, 2006. [doi]

2004

Distances and Finger Search in Random Binary Search TreesLuc Devroye, Ralph Neininger. SICOMP, 33(3):647-658, 2004. [doi]

2003

Random suffix search treesLuc Devroye, Ralph Neininger. rsa, 23(4):357-396, 2003. [doi]

2002

Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll FunctionsHsien-Kuei Hwang, Ralph Neininger. SICOMP, 31(6):1687-1722, 2002. [doi]

The Wiener Index Of Random TreesRalph Neininger. cpc, 11(6):587-597, 2002.

Rates of convergence for QuicksortRalph Neininger, Ludger RÃ¼schendorf. jal, 44(1):52-62, 2002. [doi]

2001

On a multivariate contraction method for random recursive structures with applications to QuicksortRalph Neininger. rsa, 19(3-4):498-524, 2001.

2000

Asymptotic distributions for partial match queries in K-d treesRalph Neininger. rsa, 17(3-4):403-427, 2000.

1999

Limit laws for random recursive structures and algorithmsRalph Neininger. PhD thesis, University of Freiburg, Freiburg im Breisgau, Germany, 1999. [doi]

On the internal path length of d-dimensional quad treesRalph Neininger, Ludger Rüschendorf. rsa, 15(1):25-41, 1999.

Sign in or sign up to see more results.

runs on WebDSL