Simplified stable merging tasks

DOI10.1016/0196-6774(87)90050-2zbMATH Open0641.68092OpenAlexW1983102976MaRDI QIDQ3782801FDOQ3782801

Authors: Jeffrey S. Salowe, William Steiger 

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

Recommendations

• scientific article; zbMATH DE number 4001497
• Optimizing stable in-place merging.
• A simple algorithm for in-place merging
• scientific article; zbMATH DE number 2036578
• Merging to Semistable Processes
• Merging by Decomposition Revisited
• Space-efficient parallel merging
• A Simple Algorithm for Stable Minimum Storage Merging

zbMATH Keywords

stable sortingmerging algorithm

Mathematics Subject Classification ID

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

Cited In (17)

• Space-efficient planar convex hull algorithms
• Stable Linear Time Sublinear Space Merging
• Unstable linear time O(1) space merging
• Stable duplicate-key extraction with optimal time and space bounds
• Asymptotically efficient in-place merging
• Computing the number of mergings with constraints
• Optimizing stable in-place merging.
• Stable in situ sorting and minimum data movement
• Merging by Decomposition Revisited
• Space-efficient parallel merging
• Partial sums on the ultra-wide word RAM
• Sorting multisets stably in minimum space
• On wavelet tree construction
• Optimal in-place suffix sorting
• Sorting multisets stably in minimum space
• Direct merging of delta encoded files
• Sparse suffix and LCP array: simple, direct, small, and fast

This page was built for publication: Simplified stable merging tasks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3782801)