Prof. Dr. Ralph Neininger

  • Neininger, R.
    Limit Laws for Random Recursive Structures and Algorithms.
    Dissertation, Universität Freiburg i. Br., iv, 96 p. (1999).
    [PS] [PDF]
     
  • Neininger, R. and L. Rüschendorf
    On the internal path length of d-dimensional quad trees.
    Random Structures and Algorithms 15 (1999), no. 1, 25-41.
    [ARTICLE]
     
  • Devroye, L.J.A. Fill and R. Neininger
    Perfect simulation from the quicksort limit distribution.
    Electronic Communications in Probability 5 (2000), 95-99 (electronic).
    [ARTICLE] [PDF]
     
  • Neininger, R.
    Asymptotic distributions for partial match queries in K-d trees.
    Random Structures and Algorithms 17 (2000), no. 3-4, 403-427.
    [ARTICLE]
     
  • Neininger, R. and L. Rüschendorf
    Limit laws for partial match queries in quadtrees.
    The Annals of Applied Probability 11 (2001), no. 2, 452-469.
    [ARTICLE] [PDF] ©
     
  • Neininger, R.
    Rates of convergence for products of random stochastic 2x2 matrices.
    Journal of Applied Probability 38 (2001), no. 3, 799-806.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R.
    On a multivariate contraction method for random recursive structures with applications to quicksort.
    Random Structures and Algorithms 19 (2001), no. 3-4, 498-524.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R.
    On binary search tree recursions with monomials as toll functions.
    Journal of Computational and Applied Mathematics 142 (2002), no. 1, 185-196.
    [ARTICLE] [PS] [PDF]
     
  • Devroye, L. and R. Neininger
    Density approximation and exact simulation of random variables that are solutions of fixed-point equations.
    Advances in Applied Probability 34 (2002), no. 2, 441-468.
    [ARTICLE] [PS] [PDF]
     
  • Hwang, H.-K. and R. Neininger
    Phase change of limit laws in the quicksort recurrence under varying toll functions.
    SIAM Journal on Computing 31 (2002), no. 6, 1687-1722.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R. and L. Rüschendorf
    Rates of convergence for quicksort.
    Journal of Algorithms 44 (2002), no. 1, 52-62.
    [ARTICLE] [PS] [PDF]
     
  • Devroye, L. and R. Neininger
    A note on random suffix search trees.
    Mathematics and Computer Science II (Versailles 2002), 267-278,
    Trends in Mathematics, Birkhäuser, Basel, 2002.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R.
    The Wiener index of random trees.
    Combinatorics, Probability & Computing 11 (2002), no. 6, 587-597.
    [ARTICLE] [PS] [PDF]
     
  • Mahmoud, H. M. and R. Neininger
    Distribution of distances in random binary search trees.
    The Annals of Applied Probability 13 (2003), no. 1, 253 -276.
    [ARTICLE] [PDF] ©
     
  • Devroye, L. and R. Neininger
    Random suffix search trees.
    Random Structures and Algorithms23 (2003), no. 4, 357-396.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R. and L. Rüschendorf
    A general limit theorem for recursive algorithms and combinatorial structures.
    The Annals of Applied Probability 14 (2004), no. 1, 378-418.
    [ARTICLE] [PDF] ©
     
  • Devroye, L. and R. Neininger
    Distances and finger search in random binary search trees.
    SIAM Journal on Computing 33 (2004), no. 3, 647-658.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R. and L. Rüschendorf
    On the contraction method with degenerate limit equation.
    The Annals of Probability 32 (2004), no. 3B, 2838-2856.
    [ARTICLE] [PDF] ©
     
  • Ali Khan, T. and R. Neininger
    Probabilistic analysis for randomized game tree evaluation.
    Mathematics and Computer Science III (Vienna 2004), 163-174,
    Trends in Mathematics, Birkhäuser, Basel, 2004.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R.
    Stochastische Analyse von Algorithmen, Fixpunktgleichungen und ideale Metriken.
    Habilitation (kumulativ), Universität Frankfurt a. M., 45 p. (2004).
    [PDF]
     
  • Neininger, R. and L. Rüschendorf
    Analysis of algorithms by the contraction method: additive and max-recursive sequences.
    Interacting Stochastic Systems, 435-450, Springer, 2005.
    [ARTICLE] [PS] [PDF]
     
  • Neininger, R.
    Recursive random variables with subgaussian distributions.
    Statistics & Decisions23 (2005), no. 2, 131-146.
    [ARTICLE] [PDF] ©
     
  • Ali Khan, T.Devroye, L. and R. Neininger
    A limit law for the root value of minimax trees.
    Electronic Communications in Probability 10 (2005), 273-281.
    [ARTICLE] [PDF]
     
  • Neininger, R. and L. Rüschendorf
    A survey of multivariate aspects of the contraction method.
    Discrete Mathematics & Theoretical Computer Science 8 (2006), 31-56.
    [ARTICLE] [PS] [PDF]
     
  • Fuchs, M.Hwang, H.-K. and R. Neininger
    Profiles of random trees: Limit theorems for random recursive trees and binary search trees.
    Algorithmica 46 (2006), 367-407.
    [ARTICLE] [PDF]
     
  • Caliebe, A.Krawczak, M., Neininger, R. and U. Rösler
    On the Length Distribution of External Branches in Coalescence Trees: Genetic Diversity within Species.
    Theoretical Population Biology72 (2007), 245-252.
    [ARTICLE] [PDF]
     
  • Knape, M. and R. Neininger
    A note on the approximation of perpetuities.
    DMTCS Proceedings (2007 Conference on Analysis of Algorithms), (2007), 115-126.
    [ARTICLE] [PS] [PDF]
     
  • Ali Khan, T. and R. Neininger
    Tail bounds for the Wiener index of random trees.
    DMTCS Proceedings (2007 Conference on Analysis of Algorithms), (2007), 279-290.
    [ARTICLE] [PS] [PDF]
     
  • Drmota, M.Janson, S. and R. Neininger
    A functional limit theorem for the profile of search trees.
    The Annals of Applied Probability 18 (2008), 288-333.
    [ARTICLE] [PDF]
     
  • Janson, S. and R. Neininger
    The size of random fragmentation trees.
    Probability Theory and Related Fields, 142 (2008), 399-442.
    [ARTICLE] [PS] [PDF]
     
  • Knape, M. and R. Neininger
    Approximating perpetuities.
    Methodology and Computing in Applied Probability10 (2008), 507-529.
    [ARTICLE] [PDF]
     
  • Broutin, N., Neininger, R. and H. Sulzbach
    Partial match queries in random quadtrees.
    Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) (2012), 1056-1065,
    [ARTICLE] [PDF]
     
  • Leckey, K. and R. Neininger
    Asymptotic analysis of Hoppe trees.
    Journal of Applied Probability50 (2013), 228-238.
    [ARTICLE] [PDF]
     
  • Leckey, K., Neininger, R. and W. Szpankowski
    Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov Model.
    Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA) (2013), 877-886.
    [ARTICLE] [PDF]
     
  • Knape, M. and R. Neininger
    Appendix to "Approximating perpetuities".
    Methodology and Computing in Applied Probability15 (2013), 707-712.
    [ARTICLE] [PDF]
     
  • Broutin, N., Neininger, R. and H. Sulzbach
    A limit process for partial match queries in random quad trees and 2-d trees.
    The Annals of Applied Probability23 (2013), 2560-2603.
    [ARTICLE] [PDF]
     
  • Dadoun, B. and R. Neininger
    A statistical view on exchanges in Quickselect.
    Analytic Algorithmics and Combinatorics (ANALCO) (2014), 40-51.
    [ARTICLE] [PDF]
     
  • Sulzbach, H., Neininger, R. and M. Drmota
    A Gaussian limit process for optimal FIND algorithms.
    Electronic Journal of Probability19 (2014), no. 3, 1-28.
    [ARTICLE] [PDF]
     
  • Knape, M. and R. Neininger
    Pólya Urns Via the Contraction Method.
    Combinatorics, Probability & Computing23 (2014), 1148-1186.
    [ARTICLE] [PDF]   © Cambridge University Press
     
  • Leckey, K., Neininger, R. and H. Sulzbach
    Analysis of radix selection on Markov sources.
    Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms.
    (Eds. M. Bousquet-Mélou, M. Soria). DMTCS-HAL Proceedings series
     (2014), 253-264.
    [PDF]
     
  • Messer, M., Kirchner, M., Schiemann, J., Roeper, J., Neininger, R. and G. Schneider
    A multiple filter test for the detection of rate changes in renewal processes with varying variance.
    The Annals of Applied Statistics8 (2014), 2027-2067.
    [ARTICLE] [PDF]
     
  • Neininger, R.
    Refined Quicksort asymptotics.
    Random Structures and Algorithms46 (2015), 346-361.
    [ARTICLE] [PDF]
     
  • Wild, S.Nebel, M.E. and R. Neininger
    Average Case and Distributional Analysis of Dual Pivot Quicksort.
    ACM Transactions on Algorithms11 (2015), Article No. 22.
    [ARTICLE] [PDF]
     
  • Neininger, R. and H. Sulzbach
    On a functional contraction method.
    The Annals of Probability43 (2015), 1777-1822.
    [ARTICLE] [PDF]
     
  • Müller, N.S. and R. Neininger
    The CLT Analogue for Cyclic Urns.
    Analytic Algorithmics and Combinatorics (ANALCO) (2016), 121-127.
    [ARTICLE] [PDF]
     
  • Chern, H.-H.Fuchs, M.Hwang, H.-K. and R. Neininger
    Dependence and phase changes in random m-ary search trees.
    Random Structures and Algorithms50 (2017), no. 3, 353–379.
    [ARTICLE] [PDF]
     
  • Kuntschik, A. and R. Neininger
    Rates of convergence for balanced irreducible two-color Pólya urns.
    Analytic Algorithmics and Combinatorics (ANALCO) (2017), 94-99.
    [ARTICLE] [PDF]
     
  • Drmota, M.Fuchs, M.Hwang, H.-K. and R. Neininger
    External Profile of Symmetric Digital Search Trees (Extended Abstract).
    Analytic Algorithmics and Combinatorics (ANALCO) (2017), 124-130.
    [ARTICLE] [PDF]
     
  • Neininger, R. and J. Straub
    Probabilistic Analysis of the Dual-Pivot Quicksort "Count".
    Analytic Algorithmics and Combinatorics (ANALCO) (2018), 1-7.
    [ARTICLE] [PDF]
     
  • Müller, N.S. and R. Neininger
    Refined Asymptotics for the Composition of Cyclic Urns.
    Electronic Journal of Probability23 (2018), no. 117, 1-20.
    [ARTICLE] [PDF]
     
  • Leckey, K., Neininger, R. and H. Sulzbach
    Process convergence for the complexity of Radix Selection on Markov sources.
    Stochastic Processes and their Applications129 (2019), 507-538.
    [ARTICLE] [PDF]
     
  • Neininger, R. and J. Straub
    Convergence Rates in the Probabilistic Analysis of Algorithms.
    31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), (2020), 22:1-22:13.
    [ARTICLE] [PDF]
     
  • Drmota, M.Fuchs, M.Hwang, H.-K. and R. Neininger
    Node profiles of symmetric digital search trees: Concentration properties
    Random Structures and Algorithms58 (2021), no. 3, 430-467.
    [ARTICLE] [PDF]
     
  • Fuchs, M.Holmgren, C.Mitsche, D. and R. Neininger
    A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees.
    Discrete Applied Mathematics292 (2021), 64-71.
    [ARTICLE] [PDF]
     
  • Leckey, K., Neininger, R. and W. Szpankowski
    A Limit Theorem for Radix Sort and Tries with Markovian Input.
    Submitted for publication.
    [PDF]
     
  • Neininger, R. and J. Straub
    On the contraction method with reduced independence assumptions.
    Submitted for publication (2022).
    [PDF]
     
  • Gerstenberg, J., Neininger, R. and D. Spiegel
    On solutions of the distributional Bellman equation.
    Submitted for publication (2022).
    [PDF]
Sprechstunde: nach Vereinbarung


SS 22:


WS 21/22:


  • Seminar (Master) zur Wahrscheinlichkeitstheorie: (WS21/22, 2+1 std.)

    Vorbesprechung am 15.09.2021 um 10:15 Uhr unter zoom. Die Zugangsdaten finden Sie im LSF.
    Falls Sie den Termin zur Vorbesprechung nicht wahrnehmen können, schreiben Sie mir bitte ab Anfang September per E-Mail.
Postal Address
Goethe-Universität Frankfurt
Institut für Mathematik (Fach 187)
Prof. Dr. Ralph Neininger
60629 Frankfurt am Main
Germany

Email: neiningr[at]math[dot]uni-frankfurt[dot]de
Tel: +49-(0)69-798-22514 (office)

Administrative Assistant

Office
Robert-Mayer-Straße 10, Room 701
60325 Frankfurt a.M.