An efficient multiway merging algorithm

DOI10.1007/BF02917030zbMATH Open0916.68032MaRDI QIDQ1286689FDOQ1286689

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)

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

zbMATH Keywords

merging algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Tight Bounds on the Complexity of Parallel Sorting
• Constructing sorting networks from k-sorters
• Sloping-and-shaking

Cited In (9)

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

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)