The following pages link to Building heaps fast (Q4730782):
Displaying 30 items.
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Heaps with bits (Q671419) (← links)
- BOTTOM-UP-HEAPSORT, and new variant of HEAPSORT beating, on an average, QUICKSORT (if \(n\) is not very small) (Q688722) (← links)
- Some comments on building heaps in parallel (Q689637) (← links)
- Building heaps in parallel (Q751273) (← links)
- On the random construction of heaps (Q1108784) (← links)
- The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than \(n \log n+1.1n\) (Q1186810) (← links)
- Best case lower bounds for heapsort (Q1195788) (← links)
- Weak-heap sort (Q1314628) (← links)
- On the complexity of building an interval heap (Q1327300) (← links)
- The heap-mergesort (Q1568737) (← links)
- Comparator networks for binary heap construction (Q1589657) (← links)
- QuickHeapsort, an efficient mix of classical sorting algorithms (Q1608335) (← links)
- A note on the construction of the data structure ``deap'' (Q1825631) (← links)
- Recurrence relations on heaps (Q1913701) (← links)
- The weak-heap data structure: variants and applications (Q1932363) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- An optimal algorithm for selection in a min-heap (Q2366561) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- Sorting using heap structure (Q2752277) (← links)
- An in-place heapsort algorithm requiring<i>n</i>log<i>n</i>+<i>n</i>log*<i>n</i>−0.546871<i>n</i>comparisons (Q2885554) (← links)
- STRONGER QUICKHEAPS (Q3016226) (← links)
- (Q3026346) (← links)
- An In-Place Priority Queue with O(1) Time for Push and $$\lg n + O(1)$$ lg n + O ( 1 ) Comparisons for Pop (Q3194717) (← links)
- An average case analysis of Floyd's algorithm to construct heaps (Q3718164) (← links)
- Merging heaps in parallel (Q3989853) (← links)
- A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort (Q4950608) (← links)
- Thin heaps, thick heaps (Q4962695) (← links)
- Comparator networks for binary heap construction (Q5054852) (← links)
- Heap construction: Optimal in both worst and average cases? (Q6487971) (← links)
