Pages that link to "Item:Q911311"
From MaRDI portal
The following pages link to Stable in situ sorting and minimum data movement (Q911311):
Displaying 16 items.
- Tight bounds for online stable sorting (Q553955) (← links)
- Space-efficient planar convex hull algorithms (Q596137) (← links)
- Selection from read-only memory and sorting with minimum data movement (Q671520) (← links)
- What is a sorting function? (Q843213) (← links)
- Stable duplicate-key extraction with optimal time and space bounds (Q1103387) (← links)
- Stable minimum space partitioning in linear time (Q1195932) (← links)
- Sorting multisets stably in minimum space (Q1338888) (← links)
- In-place sorting with fewer moves (Q1606923) (← links)
- Fast stable in-place sorting with \(O(n)\) data moves (Q1920426) (← links)
- Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
- Sorting stably, in place, with \(O(n \log n)\) comparisons and \(O(n)\) moves (Q2643133) (← links)
- AN ALGORITHM OF TWO-WAY PASSED AND STABLY QUICK SORT (TPQA) (Q3459793) (← links)
- Sorting with minimum data movement (Q4020351) (← links)
- (Q4028918) (← links)
- Sorting multisets stably in minimum space (Q5056159) (← links)
- STACS 2005 (Q5710714) (← links)
