Arbitrary-size permutation networks using arbitrary-radix switches

DOI10.1016/j.tcs.2023.113939OpenAlexW4375859229MaRDI QIDQ6159027

Meng Zhang, Yi Zhang

Publication date: 1 June 2023

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

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

zbMATH Keywords

interconnection networkBenes networkClos network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• A simple algorithm for edge-coloring bipartite multigraphs
• Efficient and scalable universal circuits
• On Edge Coloring Bipartite Graphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds
• A Permutation Network
• Symmetric Ternary Switching Functions: Their Detection and Realization with Threshold Logic

This page was built for publication: Arbitrary-size permutation networks using arbitrary-radix switches