Bounds on the size of merging networks

DOI10.1016/0166-218X(94)00015-6zbMATH Open0834.68016OpenAlexW2067081146MaRDI QIDQ1897347FDOQ1897347

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

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

zbMATH Keywords

sortingswitching theorymerging network

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Bounds on the size of test sets for sorting and related networks
• On the Number of Stable States in a NOR Network
• The asymptotic complexity of merging networks
• Lower Bounds on Merging Networks
• Permuting Information in Idealized Two-Level Storage

Cited In (12)

• 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
• On the optimality of tape merge of two lists with similar size
• Reaching the bound in the \((2,n)\) merging problem
• Title not available (Why is that?)

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)