An efficient multiway merging algorithm

DOI10.1007/BF02917030MaRDI QIDQ1286689zbMATH OpenFDO

Authors Qingshi Gao, Lijun Zhao, Zhi-Yong Liu

Publication date 29 April 1999

Published in Science in China. Series E (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02917030

zbMATH Keywords

merging algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Multiway in-place merging
• Multiway In-Place Merging
• Sloping-and-shaking
• Merging multiple lists on hierarchical-memory multiprocessors
• scientific article; zbMATH DE number 4001497

Cites work

• Constructing sorting networks from k-sorters
• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Sloping-and-shaking
• Tight Bounds on the Complexity of Parallel Sorting

Cited in

(12)

• Significant improvements to the Ford-Johnson algorithm for sorting
• Merging multiple lists on hierarchical-memory multiprocessors
• Sloping-and-shaking
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
• An improved analysis of linear mergers
• Efficient unbalanced merge-sort
• Multiway In-Place Merging
• SOFSEM 2006: Theory and Practice of Computer Science
• Towards simpler sorting networks and monotone circuits for majority
• A new sorting algorithm for accelerating join-based queries
• A simple algorithm for in-place merging
• Multiway in-place merging

This page was built for publication: An efficient multiway merging algorithm

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