Pages that link to "Item:Q4799522"
From MaRDI portal
The following pages link to Rates of convergence for Quicksort (Q4799522):
Displayed 10 items.
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- Distribution of distances in random binary search trees. (Q1872343) (← links)
- On the contraction method with degenerate limit equation. (Q1889801) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
- Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
- Random binary trees: from the average case analysis to the asymptotics of distributions (Q2457886) (← links)
- Refined quicksort asymptotics (Q4982619) (← links)
- A note on the quicksort asymptotics (Q5265342) (← links)
- On martingale tail sums for the path length in random trees (Q5739101) (← links)
- Central limit theorem in uniform metrics for generalized Kac equations (Q6144444) (← links)