Simplified stable merging tasks

DOI10.1016/0196-6774(87)90050-2zbMath0641.68092OpenAlexW1983102976MaRDI QIDQ3782801

William Steiger, Jeffrey S. Salowe

Publication date: 1987

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(87)90050-2

zbMATH Keywords

stable sortingmerging algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (11)

Sorting multisets stably in minimum space ⋮ Stable duplicate-key extraction with optimal time and space bounds ⋮ Space-efficient planar convex hull algorithms ⋮ Optimal in-place suffix sorting ⋮ Optimizing stable in-place merging. ⋮ Stable in situ sorting and minimum data movement ⋮ On Wavelet Tree Construction ⋮ Asymptotically efficient in-place merging ⋮ Sorting multisets stably in minimum space ⋮ Partial sums on the ultra-wide word RAM ⋮ Space-efficient parallel merging

This page was built for publication: Simplified stable merging tasks