Reaching the bound in the (2,n) merging problem

DOI10.1016/S0020-0255(98)10007-5MaRDI QIDQ1818797zbMATH OpenOpenAlexFDO

Authors Ahmed A. Belal, Amr Elmasry

Publication date 4 January 2000

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(98)10007-5

zbMATH Keywords

merging problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Computing the number of mergings with constraints
• Two Probabilistic Results on Merging
• Lower bounds for merging networks
• A new bound for Erdős’ minimum overlap problem
• ON COST-OPTIMAL MERGE OF TWO INTRANSITIVE SORTED SEQUENCES
• Merging by Decomposition Revisited
• On mergings in acyclic directed graphs
• Bounds on the size of merging networks
• Merge-proofness in minimum cost spanning tree problems
• The asymptotic complexity of merging networks

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Optimal merging of 2 elements with n elements

Cited in

(5)

• Merging of 4 or 5 elements with n elements
• On the optimality of tape merge of two lists with similar size
• Optimal expected-time algorithms for merging
• Two Probabilistic Results on Merging
• Sequential-Merge Facets for Two-Dimensional Group Problems

This page was built for publication: Reaching the bound in the \((2,n)\) merging problem

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