The following pages link to (Q3836519):
Displaying 13 items.
- Asymptotic analysis of a family of polynomials associated with the inverse error function (Q444701) (← links)
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees (Q659772) (← links)
- On the tails of the limiting QuickSort density (Q1725502) (← links)
- The height of a binary search tree: the limiting distribution perspective. (Q1853551) (← 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)
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations (Q2316591) (← links)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← links)
- On tail bounds for random recursive trees (Q2897163) (← links)
- Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures (Q3163407) (← links)
- Using nonlinear difference equations to study Quicksort algorithms (Q4960142) (← links)
- (Q4993543) (← links)
- On densities for solutions to stochastic fixed point equations (Q5381055) (← links)
