Homepage Ralph Neininger

Publications and Preprints

• Neininger, R.
  Limit Laws for Random Recursive Structures and Algorithms.
  Dissertation, Universität Freiburg i. Br., iv, 96 p. (1999).
  
   
• 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.
  
   
• Devroye, L., J.A. Fill and R. Neininger
  Perfect simulation from the quicksort limit distribution.
  Electronic Communications in Probability 5 (2000), 95-99 (electronic).
  
   
• Neininger, R.
  Asymptotic distributions for partial match queries in K-d trees.
  Random Structures and Algorithms 17 (2000), no. 3-4, 403-427.
  
   
• 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.
  ©
   
• Neininger, R.
  Rates of convergence for products of random stochastic 2x2 matrices.
  Journal of Applied Probability 38 (2001), no. 3, 799-806.
  
   
• 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.
  
   
• Neininger, R.
  On binary search tree recursions with monomials as toll functions.
  Journal of Computational and Applied Mathematics 142 (2002), no. 1, 185-196.
  
   
• 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.
  
   
• 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.
  
   
• Neininger, R. and L. Rüschendorf
  Rates of convergence for quicksort.
  Journal of Algorithms 44 (2002), no. 1, 52-62.
  
   
• 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.
  
   
• Neininger, R.
  The Wiener index of random trees.
  Combinatorics, Probability & Computing 11 (2002), no. 6, 587-597.
  
   
• 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.
  ©
   
• Devroye, L. and R. Neininger
  Random suffix search trees.
  Random Structures and Algorithms, 23 (2003), no. 4, 357-396.
  
   
• 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.
  ©
   
• Devroye, L. and R. Neininger
  Distances and finger search in random binary search trees.
  SIAM Journal on Computing 33 (2004), no. 3, 647-658.
  
   
• Neininger, R. and L. Rüschendorf
  On the contraction method with degenerate limit equation.
  The Annals of Probability 32 (2004), no. 3B, 2838-2856.
  ©
   
• 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.
  
   
• Neininger, R.
  Stochastische Analyse von Algorithmen, Fixpunktgleichungen und ideale Metriken.
  Habilitation (kumulativ), Universität Frankfurt a. M., 45 p. (2004).
  
   
• 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.
  
   
• Neininger, R.
  Recursive random variables with subgaussian distributions.
  Statistics & Decisions, 23 (2005), no. 2, 131-146.
    ©
   
• 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.
  
   
• Neininger, R. and L. Rüschendorf
  A survey of multivariate aspects of the contraction method.
  Discrete Mathematics & Theoretical Computer Science 8 (2006), 31-56.
   
   
• 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.
   
   
• 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 Biology, 72 (2007), 245-252.
   
   
• Knape, M. and R. Neininger
  A note on the approximation of perpetuities.
  DMTCS Proceedings (2007 Conference on Analysis of Algorithms), (2007), 115-126.
  
  


• 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.
  
  


• 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.
  
   
• Janson, S. and R. Neininger
  The size of random fragmentation trees.
  Probability Theory and Related Fields, 142 (2008), 399-442.
   
   
• Knape, M. and R. Neininger
  Approximating perpetuities.
  Methodology and Computing in Applied Probability, 10 (2008), 507-529.
  
   

Chess