We present a systolic algorithm to generate all the n! permutations of n given items. This algorithm requires n time steps to solve this problem.Expand

Given n items, a parallel algorithm for generating the n! permutations is presented. Each PE is responsible for producing one component of each permutation.Expand

Abstract Given n elements and an arbitrary integer m for m ⩽ n, a systolic algorithm for generating all r -subsets (subsets containing r elements) with 1 ⩽ r ⩽ m in lexicographic order is presented.… Expand

Given n items, a parallel algorithm for generating all the n! permutations is presented. The design procedures of this algorithm are considered in detail.Expand

Free-carrier absorption in n-type GaAs films has been investigated for the case where the free carriers are confined in a quasi-two-dimensional semiconducting structure with a non-parabolic energy… Expand

The impurity-limited mobility of semiconducting thin wires for the nonparabolic band structure of electrons in n-type gallium arsenide has been investigated by scattering from ionized impurities or… Expand