Optimal expected-time algorithms for merging

DOI10.1016/0196-6774(86)90026-XMaRDI QIDQ3777464zbMATH OpenFDO

Authors

Publication date 1986

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

Full work available at URL https://doi.org/10.1016/0196-6774(86)90026-X

zbMATH Keywords

mergingOptimal expected-time algorithms

Mathematics Subject Classification ID

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

Recommendations

• On the optimality of tape merge of two lists with similar size
• scientific article; zbMATH DE number 3990870
• On the optimality of tape merge of two lists with similar size
• Reaching the bound in the \((2,n)\) merging problem
• Two Probabilistic Results on Merging

Cited in

(9)

• scientific article; zbMATH DE number 3990870 (Why is no real title available?)
• Small Complexity Gaps for Comparison-Based Sorting
• Computing the number of mergings with constraints
• Expected time analysis of interpolation merge -- a simple new merging algorithm
• On the optimality of tape merge of two lists with similar size
• Average merge time: an intuitive interpretation
• On the optimality of tape merge of two lists with similar size
• Optimal merging of sorted data under the mean absolute error criterion
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Optimal expected-time algorithms for merging

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