Some minimum merging networks

DOI10.1016/J.TCS.2004.09.003MaRDI QIDQ706629zbMATH OpenOpenAlexFDO

Authors Gembu Morohashi, Shigeki Iwata

Publication date 9 February 2005

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2004.09.003

zbMATH Keywords

Lower boundComparatorMerging networkOdd-even mergeSorting network

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10)

Recommendations

• Mathematical Foundations of Computer Science 2003
• Lower bounds for merging networks
• Periodic merging networks
• Bounds on the size of merging networks
• Periodic merging networks

Cites work

• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• Bounds on the size of merging networks
• Lower Bounds on Merging Networks
• Lower bounds for merging networks
• Mathematical Foundations of Computer Science 2003
• The asymptotic complexity of merging networks

Cited in

(7)

• scientific article; zbMATH DE number 1256659 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Periodic merging networks
• Merging of 4 or 5 elements with n elements
• Better understanding of Batcher's merging networks
• Lower bounds for merging networks
• Bounds on the size of merging networks

This page was built for publication: Some minimum merging networks

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