article · International Journal of Computer Mathematics · 1991
Parallel permutation generation on linear array
Cited by 6Abstract and details only
Abstract
Given n items, a parallel algorithm for generating all the n! permutations is presented. The computational model used is a linear array which consists of n identical processing elements with a simple structure. One permutation is produced at each other time step. The elapsed time to produce a permutation is independent of the integer n. The basic idea used is the iterative method and the exchange of two consecutive components in an existing permutation. The design procedures of this algorithm are considered in detail. The ranking and unranking functions of the required permutations are also discussed.
Cite this paper
Lin, C.-J. (1991). Parallel permutation generation on linear array. International Journal of Computer Mathematics, 38(3-4), 113–121. https://doi.org/10.1080/00207169108803963
Lin, Chau-Jy. “Parallel permutation generation on linear array.” International Journal of Computer Mathematics, vol. 38, no. 3-4, 1991, pp. 113–21, https://doi.org/10.1080/00207169108803963.
Lin, Chau-Jy. 1991. “Parallel permutation generation on linear array.” International Journal of Computer Mathematics 38 (3-4): 113–21. https://doi.org/10.1080/00207169108803963.
Lin, C.-J. (1991) ‘Parallel permutation generation on linear array’, International Journal of Computer Mathematics, 38(3-4), pp. 113–121. Available at: https://doi.org/10.1080/00207169108803963.
@article{lin1991parallel,
title = {{Parallel permutation generation on linear array}},
author = {Lin, Chau-Jy},
journal = {International Journal of Computer Mathematics},
volume = {38},
number = {3-4},
pages = {113--121},
year = {1991},
doi = {10.1080/00207169108803963}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.