The following pages link to Ralph Neininger (Q370894):
Displaying 50 items.
- A multiple filter test for the detection of rate changes in renewal processes with varying variance (Q146393) (← links)
- Appendix to ``Approximating perpetuities'' (Q370895) (← links)
- A limit process for partial match queries in random quadtrees and 2-d trees (Q389077) (← links)
- (Q398786) (redirect page) (← links)
- Approximating perpetuities (Q398787) (← links)
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees (Q866961) (← links)
- The size of random fragmentation trees (Q946483) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- Perfect simulation from the quicksort limit distribution (Q1572752) (← links)
- On binary search tree recursions with monomials as toll functions (Q1612304) (← links)
- Process convergence for the complexity of radix selection on Markov sources (Q1713466) (← links)
- Refined asymptotics for the composition of cyclic urns (Q1722011) (← links)
- Distribution of distances in random binary search trees. (Q1872343) (← links)
- Limit laws for partial match queries in quadtrees (Q1872463) (← links)
- On the contraction method with degenerate limit equation. (Q1889801) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- On a functional contraction method (Q2354151) (← links)
- A limit law for the root value of minimax trees (Q2433659) (← links)
- On the length distribution of external branches in coalescence trees: Genetic diversity within species (Q2459063) (← links)
- A functional limit theorem for the profile of search trees (Q2476407) (← links)
- A Gaussian limit process for optimal FIND algorithms (Q2637747) (← links)
- On a multivariate contraction method for random recursive structures with applications to Quicksort (Q2772929) (← links)
- Rates of convergence for products of random stochastic 2 × 2 matrices (Q2774460) (← links)
- Analysis of radix selection on Markov sources (Q2789563) (← links)
- Pólya Urns Via the Contraction Method (Q2929861) (← links)
- Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions (Q3149890) (← links)
- Density approximation and exact simulation of random variables that are solutions of fixed-point equations (Q3149977) (← links)
- (Q3154675) (← links)
- Recursive random variables with subgaussian distributions (Q3365775) (← links)
- (Q3576758) (← links)
- (Q3576771) (← links)
- On the internal path length ofd-dimensional quad trees (Q4262416) (← links)
- (Q4428913) (← links)
- Random suffix search trees (Q4446869) (← links)
- (Q4521555) (← links)
- Distances and Finger Search in Random Binary Search Trees (Q4651486) (← links)
- (Q4792912) (← links)
- Rates of convergence for Quicksort (Q4799522) (← links)
- Asymptotic Analysis of Hoppe Trees (Q4918574) (← links)
- (Q4936224) (← links)
- Average Case and Distributional Analysis of Dual-Pivot Quicksort (Q4962180) (← links)
- Refined quicksort asymptotics (Q4982619) (← links)
- A statistical view on exchanges in Quickselect (Q5194755) (← links)
- The CLT Analogue for Cyclic Urns (Q5194948) (← links)
- Rates of convergence for balanced irreducible two-color Pólya urns (Q5195040) (← links)
- External Profile of Symmetric Digital Search Trees (Extended Abstract) (Q5195043) (← links)
- Probabilistic Analysis of the Dual-Pivot Quicksort “Count” (Q5195099) (← links)
- (Q5387665) (← links)
- (Q5718849) (← links)
- Dependence and phase changes in random <i>m</i>‐ary search trees (Q5739094) (← links)
