scientific article; zbMATH DE number 140497
From MaRDI portal
Publication:4028918
Recommendations
- Sorting with minimum data movement
- Stable in situ sorting and minimum data movement
- In-place sorting with fewer moves
- Selection from read-only memory and sorting with minimum data movement
- Optimally sorting evolving data
- Fast stable in-place sorting with \(O(n)\) data moves
- Sorting by bounded block-moves
- Sorting by placement and shift
- Minimum cost sorting problem
Cited in
(11)- Sorting numbers in linear expected time and optimal extra space
- In-place sorting with fewer moves
- In-place sorting
- Electronic Data Sorting
- Linear-time in-place selection with \(\varepsilon \cdot n\) element moves
- An in-place sorting with O ( n log n ) comparisons and O ( n ) moves
- Sort Me If You Can: How to Sort Dynamic Data
- Sorting with minimum data movement
- scientific article; zbMATH DE number 1926670 (Why is no real title available?)
- Selection from read-only memory and sorting with minimum data movement
- Stable in situ sorting and minimum data movement
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028918)
