Parallel generation of permutations and combinations
In this paper we present a parallel algorithm to generate the permutations of at most k out of n objects. The architecture consists of a linear processor array and a selector. When one single processor array is available, a parallel algorithm to generate permutations is presented wich achieves the best possible speedup for any given k. Also, this algorithm can easily be modified to generate combinations. When multiple processor arrays are available, a parallel scheme is proposed to speed up the generation by fully utilizing these processor arrays. The degree of parallelism is related to the number of available processor arrays.
- Generating combinations in parallel
- A parallel algorithm for generating combinations
- Fast parallel generation of random permutations
- New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
- scientific article; zbMATH DE number 3843149
- A parallel algorithm for the generation of a permutation and applications
- Parallel generation of permutations on systolic arrays
- Parallel permutation generation on linear array
- An optimal parallel algorithm for generating combinations
- Generating combinations in parallel
- A simple systolic algorithm for generating combinations in lexicographic order
- A parallel algorithm for the generation of a permutation and applications
- A parallel derangement generation algorithm
- A parallel algorithm for generating combinations
- A systolic generation of combinations
- New methods for the generation of permutations, combinations, and other combinatorial objects in parallel
- Integrated strategy for generating permutation
- Parallel permutation generation on linear array
- scientific article; zbMATH DE number 3843149 (Why is no real title available?)
- Listing combinatorial objects in parallel
- scientific article; zbMATH DE number 4053045 (Why is no real title available?)
- A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems
- Efficient enumeration of cyclic permutations in situ
- Permutation Generation on Vector Processors
- On random and adaptive parallel generation of combinatorial objects
- scientific article; zbMATH DE number 871160 (Why is no real title available?)
- An optimal parallel algorithm for generating combinations
- Generating subsets on a systolic array
- An optimal algorithm for generating equivalence relations on a linear array of processors
- Parallel algorithm for generating permutations on linear array
- On generation of permutations through decomposition of symmetric groups into cosets
This page was built for publication: Parallel generation of permutations and combinations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085616)