Universality of iterated networks

DOI10.1007/BF01184932zbMath0806.94034OpenAlexW4238879029MaRDI QIDQ4311638

Charles M. Fiduccia, Robert F. Chamberlain

Publication date: 19 February 1995

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01184932

zbMATH Keywords

digraphpermutationiterated networkmultistage networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (7)

Structure of algebras of commutative matrices ⋮ Universality of iterated networks ⋮ The complexity of vector-products ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ On the optimal evaluation of a set of bilinear forms ⋮ De Bruijn digraphs and affine transformations ⋮ Rank and optimal computation of generic tensors

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial distribution problem
• The Enumeration of Locally Restricted Graphs (I)
• Invariant Properties of the Shuffle-Exchange and a Simplified Cost-Effective Version of the Omega Network
• Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8
• Notes on Shuffle/Exchange-Type Switching Networks
• The Universality of the Shuffle-Exchange Network
• Access and Alignment of Data in an Array Processor
• The Indirect Binary n-Cube Microprocessor Array
• Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks
• Universality of iterated networks
• A Permutation Network
• The Use of S-Functions in Combinatorial Analysis
• Parallel Processing with the Perfect Shuffle

This page was built for publication: Universality of iterated networks