On generation of permutations through decomposition of symmetric groups into cosets

DOI10.1007/BF01933207zbMath0711.68042OpenAlexW2022458494MaRDI QIDQ922698

Zbigniew Kokosiński

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemsparallel computershardware-oriented algorithmpermutation generator

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (2)

On generation of permutations of \(m\) out of \(n\) items ⋮ Listing combinatorial objects in parallel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• More permutation generation methods
• A new algorithm for generation of permutations
• Parallel generation of permutations and combinations
• A parallel derangement generation algorithm
• New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
• Parallel Generation of Permutations
• Programming Cellular Permutation Networks Through Decomposition of Symmetric Groups
• A new algorithm for generating derangements
• Permutation Generation on Vector Processors
• Cellular Interconnection Arrays
• Complete mappings of finite groups

This page was built for publication: On generation of permutations through decomposition of symmetric groups into cosets