𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A systolic design for generating permutations in lexicographic order

✍ Scribed by Wei-Ping Lee; Jong-Chuang Tsay

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
457 KB
Volume
20
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Optimal Systolic Algorithm for Genera
An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order
✍ S.G. Akl; H. Meijer; I. Stojmenovic πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 693 KB

A systolic algorithm is described for generating all permutations of \(n\) elements in lexicographic order. The algorithm is designed to be executed on a linear array of \(n\) processors, each having constant size memory, and each being responsible for producing one element of a given permutation. T

A Cost-Optimal Pipeline Algorithm for Pe
A Cost-Optimal Pipeline Algorithm for Permutation Generation in Lexicographic Order
✍ ClΓ©mentin Tayou Djamegni; Maurice TchuentΓ© πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 142 KB

In this paper we solve the open problem of designing a costoptimal parallel algorithm for generating permutations of M elements out of the set {0, 1, . . . , N -1}, in lexicographic order. Our algorithm runs on the simplest model of parallel computation, i.e., a linear array of size M, where each pr

An optimal parallel algorithm for genera
An optimal parallel algorithm for generating permutations in minimal change order
✍ Jong-Chuang Tsay; Wei-Ping Lee πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 430 KB

Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo