Merging by Decomposition Revisited

DOI10.1093/COMJNL/31.6.553MaRDI QIDQ3813306zbMATH OpenOpenAlexFDO

Authors

Publication date 1988

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/31.6.553

zbMATH Keywords

quicksortsortingstable merging by decomposition

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4001497
• Stable Linear Time Sublinear Space Merging
• Unstable linear time O(1) space merging
• SOFSEM 2006: Theory and Practice of Computer Science
• Simplified stable merging tasks

Cited in

(11)

• Simplified stable merging tasks
• Disjunctive merging: quota and Gmin merging operators
• Multiple Intermediate Structure Deforestation by Shortcut Fusion
• Manipulation via merging and splitting in claims problems
• scientific article; zbMATH DE number 6538194 (Why is no real title available?)
• An improved analysis of linear mergers
• Merging in maps and in pavings
• Reaching the bound in the \((2,n)\) merging problem
• Two Probabilistic Results on Merging
• scientific article; zbMATH DE number 3890714 (Why is no real title available?)
• Simplification of Morse Decompositions Using Morse Set Mergers

This page was built for publication: Merging by Decomposition Revisited

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