The following pages link to STACS 2005 (Q5710714):
Displaying 7 items.
- Tight bounds for online stable sorting (Q553955) (← links)
- What is a sorting function? (Q843213) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- In-place sorting with fewer moves (Q1606923) (← links)
- Fast stable in-place sorting with \(O(n)\) data moves (Q1920426) (← links)
- Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves (Q2643133) (← 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)
