Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups

DOI10.1109/TC.1987.1676977MaRDI QIDQ3770457zbMATH OpenFDO

Authors A. Yavuz Oruç, Melda Yaman Oruç

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1987.1676977

zbMATH Keywords

cellular permutation arraysiterative coset decompositions of symmetric groupslinear time algorithms

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Symmetric groups (20B30) Cellular automata (computational aspects) (68Q80) Applications of design theory to circuits and networks (94C30)

Recommendations

• On generation of permutations through decomposition of symmetric groups into cosets
• On generation of permutations of \(m\) out of \(n\) items
• Routing Algorithms for Cellular Interconnection Arrays
• Permutation group algorithms based on partitions. I: Theory and algorithms
• A permutation-generating algorithm

Cited in

(3)

• On generation of permutations of \(m\) out of \(n\) items
• Routing Algorithms for Cellular Interconnection Arrays
• On generation of permutations through decomposition of symmetric groups into cosets

This page was built for publication: Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups

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