The following pages link to Weak-heap sort (Q1314628):
Displaying 12 items.
- Weak heaps engineered (Q396692) (← links)
- QuickHeapsort: modifications and improved analysis (Q504991) (← links)
- Heaps with bits (Q671419) (← links)
- The weak-heap data structure: variants and applications (Q1932363) (← links)
- Regular numeral systems for data structures (Q2139186) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Optimizing binary heaps (Q2411045) (← links)
- A Survey on Priority Queues (Q2848973) (← 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)
- 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)
- A PRIORITY QUEUE WITH THE WORKING-SET PROPERTY (Q3421856) (← links)
- Bipartite binomial heaps (Q4637854) (← links)
