Bounds on the size of merging networks

DOI10.1016/0166-218X(94)00015-6zbMath0834.68016OpenAlexW2067081146MaRDI QIDQ1897347

Martin Aigner, Otfried Schwarzkopf

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)

Related Items (2)

Some minimum merging networks ⋮ Lower bounds for merging networks

Cites Work

• Unnamed Item
• Bounds on the size of test sets for sorting and related networks
• Lower Bounds on Merging Networks
• The asymptotic complexity of merging networks
• Permuting Information in Idealized Two-Level Storage
• On the Number of Stable States in a NOR Network

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