Parallel Generation of Permutations

DOI10.1093/COMJNL/26.2.97MaRDI QIDQ3657425zbMATH OpenOpenAlexFDO

Authors P. Gupta, G. P. Bhattacharjee

Publication date 1983

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/26.2.97

zbMATH Keywords

parallel algorithmSIMD computer

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(14)

• An optimal algorithm for generating equivalence relations on a linear array of processors
• A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
• On generation of permutations of \(m\) out of \(n\) items
• Efficient enumeration of cyclic permutations in situ
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• Parallel permutation generation on linear array
• Random generation of permutations of the symmetric group or the alternating group
• On random and adaptive parallel generation of combinatorial objects
• Parallel algorithm for generating permutations on linear array
• On generation of permutations through decomposition of symmetric groups into cosets
• A parallel derangement generation algorithm
• Listing combinatorial objects in parallel
• An efficient algorithm for random sampling without replacement

This page was built for publication: Parallel Generation of Permutations

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