default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph Neininger
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Jasper Ischebeck, Ralph Neininger:
On Fluctuations of Complexity Measures for the FIND Algorithm. AofA 2024: 9:1-9:15- [c10]Louigi Addario-Berry, Pat Morin
, Ralph Neininger:
Patricia's Bad Distributions. AofA 2024: 25:1-25:8 - [i15]Julian Gerstenberg, Ralph Neininger, Denis Spiegel:
On Policy Evaluation Algorithms in Distributional Reinforcement Learning. CoRR abs/2407.14175 (2024) - 2022
- [c9]Ralph Neininger, Jasmin Straub:
On the Contraction Method with Reduced Independence Assumptions. AofA 2022: 14:1-14:13 - [i14]Julian Gerstenberg, Ralph Neininger, Denis Spiegel:
On solutions of the distributional Bellman equation. CoRR abs/2202.00081 (2022) - 2021
- [j17]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: 64-71 (2021) - [j16]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Node profiles of symmetric digital search trees: Concentration properties. Random Struct. Algorithms 58(3): 430-467 (2021) - 2020
- [c8]Ralph Neininger, Jasmin Straub:
Convergence Rates in the Probabilistic Analysis of Algorithms. AofA 2020: 22:1-22:13
2010 – 2019
- 2019
- [j15]Hsien-Kuei Hwang, Ralph Neininger, Marek Zaionc:
Preface. Comb. Probab. Comput. 28(4): 483-484 (2019) - 2018
- [c7]Ralph Neininger, Jasmin Straub:
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". ANALCO 2018: 1-7 - 2017
- [j14]Hua-Huai Chern, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
Dependence and phase changes in random m-ary search trees. Random Struct. Algorithms 50(3): 353-379 (2017) - [c6]Andrea Kuntschik, Ralph Neininger:
Rates of convergence for balanced irreducible two-color Pólya urns. ANALCO 2017: 94-99 - [c5]Michael Drmota, Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger:
External Profile of Symmetric Digital Search Trees (Extended Abstract). ANALCO 2017: 124-130 - [i13]Ralph Neininger, Jasmin Straub:
Probabilistic Analysis of the Dual-Pivot Quicksort "Count". CoRR abs/1710.07505 (2017) - 2016
- [c4]Noela S. Müller, Ralph Neininger:
The CLT Analogue for Cyclic Urns. ANALCO 2016: 121-127 - [i12]Kevin Leckey, Ralph Neininger, Henning Sulzbach:
Process convergence for the complexity of Radix Selection on Markov sources. CoRR abs/1605.02352 (2016) - 2015
- [j13]Ralph Neininger:
Refined quicksort asymptotics. Random Struct. Algorithms 46(2): 346-361 (2015) - [j12]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms 11(3): 22:1-22:42 (2015) - [i11]Kevin Leckey, Ralph Neininger, Wojciech Szpankowski:
A Limit Theorem for Radix Sort and Tries with Markovian Input. CoRR abs/1505.07321 (2015) - [i10]Noela S. Müller, Ralph Neininger:
The CLT Analogue for Cyclic Urns. CoRR abs/1507.08119 (2015) - 2014
- [j11]Margarete Knape, Ralph Neininger:
Pólya Urns Via the Contraction Method. Comb. Probab. Comput. 23(6): 1148-1186 (2014) - [c3]Benjamin Dadoun, Ralph Neininger:
A statistical view on exchanges in Quickselect. ANALCO 2014: 40-51 - 2013
- [j10]Kevin Leckey, Ralph Neininger:
Asymptotic Analysis of Hoppe Trees. J. Appl. Probab. 50(1): 228-238 (2013) - [c2]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: 877-886 - [i9]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort. CoRR abs/1304.0988 (2013) - [i8]Benjamin Dadoun, Ralph Neininger:
A statistical view on exchanges in Quickselect. CoRR abs/1307.8403 (2013) - 2012
- [c1]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
Partial match queries in random quadtrees. SODA 2012: 1056-1065 - [i7]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
A limit process for partial match queries in random quadtrees. CoRR abs/1202.1342 (2012) - [i6]Ralph Neininger, Henning Sulzbach:
On a functional contraction method. CoRR abs/1202.1370 (2012) - [i5]Kevin Leckey, Ralph Neininger:
Asymptotic analysis of Hoppe trees. CoRR abs/1202.2439 (2012) - [i4]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 abs/1207.0302 (2012) - [i3]Ralph Neininger:
A refined Quicksort asymptotic. CoRR abs/1207.4556 (2012) - 2011
- [i2]Nicolas Broutin, Ralph Neininger, Henning Sulzbach:
Partial match queries in random quadtrees. CoRR abs/1107.2231 (2011)
2000 – 2009
- 2006
- [j9]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): 367-407 (2006) - 2004
- [j8]Luc Devroye, Ralph Neininger:
Distances and Finger Search in Random Binary Search Trees. SIAM J. Comput. 33(3): 647-658 (2004) - 2003
- [j7]Luc Devroye, Ralph Neininger:
Random suffix search trees. Random Struct. Algorithms 23(4): 357-396 (2003) - 2002
- [j6]Ralph Neininger:
The Wiener Index Of Random Trees. Comb. Probab. Comput. 11(6): 587-597 (2002) - [j5]Ralph Neininger, Ludger Rüschendorf:
Rates of convergence for Quicksort. J. Algorithms 44(1): 52-62 (2002) - [j4]Hsien-Kuei Hwang, Ralph Neininger:
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions. SIAM J. Comput. 31(6): 1687-1722 (2002) - 2001
- [j3]Ralph Neininger:
On a multivariate contraction method for random recursive structures with applications to Quicksort. Random Struct. Algorithms 19(3-4): 498-524 (2001) - 2000
- [j2]Ralph Neininger:
Asymptotic distributions for partial match queries in K-d trees. Random Struct. Algorithms 17(3-4): 403-427 (2000) - [i1]Luc Devroye, James Allen Fill, Ralph Neininger:
Perfect simulation from the Quicksort limit distribution. CoRR math.PR/0005237 (2000)
1990 – 1999
- 1999
- [b1]Ralph Neininger:
Limit laws for random recursive structures and algorithms. University of Freiburg, Freiburg im Breisgau, Germany, 1999, pp. 1-96 - [j1]Ralph Neininger, Ludger Rüschendorf:
On the internal path length of d-dimensional quad trees. Random Struct. Algorithms 15(1): 25-41 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 00:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
