Parallel permutation generation on linear array

References

• Akl , S. G. 1987 . Adaptive and optimal parallel algorithms for enumerating permutations and combinations . The Computer Journal , 30 : 433 – 436 .
   Web of Science ®Google Scholar
• Chen , G. H. and Chern , M. S. 1986 . Parallel generation of permutations and combinations . BIT , 26 : 277 – 283 .
   Web of Science ®Google Scholar
• Evans , D. J. 1988 . Systolic algorithms . Intern. J. Computer Math. , 25 : 155 – 172 .
   Web of Science ®Google Scholar
• Gupta , P. and Bhattackerjee , G. P. 1983 . Parallel generation of permutations . The Computer Journal , 26 : 97 – 105 .
   Web of Science ®Google Scholar
• Kung , H. T. 1982 . Why systolic architecture? . IEEE Trans. Computers , 15 : 37 – 46 .
   Google Scholar
• Lin , C.-J. 1989 . A parallel algorithm for generating combinations . Computer & Mathematics with Applications , 12 : 1523 – 1533 .
   Google Scholar
• Mor , U. and Fraenkel , A. S. 1982 . Permutation generation on vector processors . The Computer Journal , 25 : 423 – 428 .
   Web of Science ®Google Scholar
• Sedgewick , R. 1977 . Permutation generation method . Computing Surveys , 9 : 137 – 164 .
   Web of Science ®Google Scholar
• Zals , S. 1984 . A new algorithm for generation of permutations . BIT , 24 : 196 – 204 .
   Google Scholar