The following pages link to Refined quicksort asymptotics (Q4982619):
Displaying 15 items.
- Randomized sequential importance sampling for estimating the number of perfect matchings in bipartite graphs (Q820917) (← links)
- Edgeworth expansions for profiles of lattice branching random walks (Q1700407) (← links)
- Refined asymptotics for the composition of cyclic urns (Q1722011) (← links)
- Asymptotic analysis of an optimized quicksort algorithm. (Q1853184) (← links)
- Logarithmic integrals, zeta values, and tiered binomial coefficients (Q2664019) (← links)
- Exact \(L^2\)-distance from the limit for QuickSort key comparisons (extended abstract). (Q2920866) (← links)
- (Q3633741) (← links)
- On martingale tail sums in affine two-color urn models with multiple drawings (Q4684841) (← links)
- Quicksort asymptotics (Q4799520) (← links)
- (Q4993545) (← links)
- Weakly protected nodes in random binary search trees (Q5037204) (← links)
- A note on the quicksort asymptotics (Q5265342) (← links)
- Computing and Combinatorics (Q5716964) (← links)
- Dependence and phase changes in random <i>m</i>‐ary search trees (Q5739094) (← links)
- On martingale tail sums for the path length in random trees (Q5739101) (← links)
