scientific article; zbMATH DE number 909705
From MaRDI portal
Recommendations
Cited in
(15)- Asymptotic expansions of the mergesort recurrences
- Mellin transforms and asymptotics. The mergesort recurrence
- An asymptotic theory for recurrence relations based on minimization and maximization.
- A general limit theorem for recursive algorithms and combinatorial structures
- Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
- Bottom-up mergesort -- A detailed analysis
- QuickXsort: a fast sorting scheme in theory and practice
- scientific article; zbMATH DE number 2130666 (Why is no real title available?)
- scientific article; zbMATH DE number 3990870 (Why is no real title available?)
- scientific article; zbMATH DE number 4094834 (Why is no real title available?)
- Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
- Stochastic analysis of the Merge-Sort algorithm
- Stochastic Analysis of ‘Simultaneous Merge–Sort'
- scientific article; zbMATH DE number 7359768 (Why is no real title available?)
- Local limit theorems for subgraph counts
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888166)