Publication:4993558
From MaRDI portal
DOI10.4230/LIPIcs.AofA.2018.36zbMath1478.68071arXiv1803.05948MaRDI QIDQ4993558
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1803.05948
average-case analysis; constant-factor optimal sorting; in-situ sorting; pivot sampling; QuickHeapsort; QuickMergesort; Quicksort recurrence
Related Items
Uses Software
Cites Work
- QuickHeapsort: modifications and improved analysis
- Asymptotic expansions of the mergesort recurrences
- Mellin transforms and asymptotics. The mergesort recurrence
- QuickHeapsort, an efficient mix of classical sorting algorithms
- Bottom-up mergesort -- A detailed analysis
- Optimal Sampling Strategies in Quicksort and Quickselect
- In-Place Sorting
- Improved master theorems for divide-and-conquer recurrences
- An average case analysis of Floyd's algorithm to construct heaps
- QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average
- A Tournament Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item