Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups

DOI10.1109/TC.1987.1676977zbMath0632.94036MaRDI QIDQ3770457

Melda Yaman Oruç, A. Yavuz Oruç

Publication date: 1987

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

zbMATH Keywords

linear time algorithmscellular permutation arraysiterative coset decompositions of symmetric groups

Mathematics Subject Classification ID

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

Related Items (2)

On generation of permutations of \(m\) out of \(n\) items ⋮ 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