Pages that link to "Item:Q1338888"
From MaRDI portal
The following pages link to Sorting multisets stably in minimum space (Q1338888):
Displaying 14 items.
- Selection from read-only memory with limited workspace (Q744087) (← links)
- A space efficient distributive sort (Q758207) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Stable in situ sorting and minimum data movement (Q911311) (← links)
- Sorting streamed multisets (Q975507) (← links)
- Stable duplicate-key extraction with optimal time and space bounds (Q1103387) (← links)
- Stable set and multiset operations in optimal time and space (Q1182083) (← links)
- Stable minimum space partitioning in linear time (Q1195932) (← links)
- Reflections on and of minor-closed classes of multisorted operations (Q1991603) (← links)
- Line-segment intersection made in-place (Q2385700) (← links)
- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset (Q3046517) (← links)
- (Q4037442) (← links)
- Sorting multisets stably in minimum space (Q5056159) (← links)
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION (Q5305546) (← links)
