Bounds on the size of merging networks

DOI10.1016/0166-218X(94)00015-6MaRDI QIDQ1897347zbMATH OpenOpenAlexFDO

Authors Martin Aigner, Otfried Cheong

Publication date 18 March 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(94)00015-6

zbMATH Keywords

sortingswitching theorymerging network

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Lower bounds for merging networks
• Better understanding of Batcher's merging networks
• scientific article; zbMATH DE number 1256659
• Periodic merging networks
• Some minimum merging networks

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Bounds on the size of test sets for sorting and related networks
• Lower Bounds on Merging Networks
• On the Number of Stable States in a NOR Network
• Permuting Information in Idealized Two-Level Storage
• The asymptotic complexity of merging networks

Cited in

(12)

• scientific article; zbMATH DE number 1256659 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2003
• Some minimum merging networks
• Periodic merging networks
• Computing the number of mergings with constraints
• Merging of 4 or 5 elements with n elements
• Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
• Better understanding of Batcher's merging networks
• Lower bounds for merging networks
• A note on Gray code and odd-even merge
• Reaching the bound in the \((2,n)\) merging problem
• On the optimality of tape merge of two lists with similar size

This page was built for publication: Bounds on the size of merging networks

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