The following pages link to Quicksort asymptotics (Q4799520):
Displaying 27 items.
- Approximating perpetuities (Q398787) (← links)
- The total path length of split trees (Q691101) (← links)
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates (Q1394520) (← links)
- An efficient algorithm for overcomplete sparsifying transform learning with signal denoising (Q1793434) (← links)
- Asymptotic analysis of an optimized quicksort algorithm. (Q1853184) (← 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)
- Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm (Q1994506) (← links)
- Almost sure convergence to the quicksort process (Q2196368) (← links)
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations (Q2316591) (← links)
- Density functions for \texttt{QuickQuant} and \texttt{QuickVal} (Q2679697) (← links)
- Approximating the limiting quicksort distribution (Q2772925) (← links)
- Exact \(L^2\)-distance from the limit for QuickSort key comparisons (extended abstract). (Q2920866) (← links)
- A weakly 1-stable distribution for the number of random records and cuttings in split trees (Q2996574) (← links)
- Random Records and Cuttings in Binary Search Trees (Q3058297) (← links)
- Quicksort: Combining Concurrency, Recursion, and Mutable Data Structures (Q3163407) (← links)
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise (Q3599150) (← links)
- (Q3633741) (← links)
- The Number of Symbol Comparisons in QuickSort and QuickSelect (Q3638078) (← links)
- How Many Comparisons Does Quicksort Use? (Q4857539) (← links)
- Refined quicksort asymptotics (Q4982619) (← links)
- (Q4993558) (← links)
- A note on the quicksort asymptotics (Q5265342) (← links)
- Computing and Combinatorics (Q5716964) (← links)
- On martingale tail sums for the path length in random trees (Q5739101) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925527) (← links)
- Upper tail analysis of bucket sort and random tries (Q5925674) (← links)
