The following pages link to In-place sorting with fewer moves (Q1606923):
Displaying 11 items.
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Multiway in-place merging (Q964398) (← links)
- Fast stable in-place sorting with \(O(n)\) data moves (Q1920426) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves (Q2643133) (← links)
- Sorting with minimum data movement (Q4020351) (← links)
- (Q4028918) (← links)
- The Optimal Order Policy for a Capacitated Multiple Product Inventory System Under Symmetry (Q5255181) (← links)
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION (Q5305546) (← links)
- STACS 2005 (Q5710714) (← links)