The following pages link to Limit theorems for mergesort (Q4888166):
Displaying 13 items.
- Asymptotic expansions of the mergesort recurrences (Q1127820) (← links)
- Mellin transforms and asymptotics. The mergesort recurrence (Q1338908) (← links)
- An asymptotic theory for recurrence relations based on minimization and maximization. (Q1401173) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures (Q1870561) (← links)
- Bottom-up mergesort -- A detailed analysis (Q1899222) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- (Q3753488) (← links)
- Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms (Q4303895) (← links)
- Stochastic analysis of the Merge-Sort algorithm (Q4350886) (← links)
- Stochastic Analysis of ‘Simultaneous Merge–Sort' (Q4361800) (← links)
- (Q4993558) (← links)
- Local limit theorems for subgraph counts (Q6176774) (← links)
