Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Akl, S.G.: Design and analysis of parallel algorithms, pp. 148–150. Prentice Hall, Englewood Cliffs (1989)
2. Akl, S.G.: Adaptive and optimal parallel algorithms for enumerating permutations and combinations. The Computer Journal 30, 433–436 (1987)
3. Akl, S.G., Meijer, H., Stojmenović, I.: Optimal parallel algorithms for generating permutations. TR 90-270, Dept. of Computing and Information Science, Queen’s University, Kingston, Ontario, Canada (1990)
4. Kautz, W.H., Levitt, K.N., Waksman, A.: Cellular interconnection arrays. IEEE Transactions on Computers C-17, 443–451 (1968)
5. Kokosiński, Z.: On generation of permutations through decomposition of symmetric groups into cosets. BIT 30, 583–591 (1990)