This is a preview of subscription content, log in via an institution to check access.
References
AklS.G. “Adaptive and optimal parallel algorithms for enumerating permutations and combinations”. The Computer Journal, 30(5):433–436, 1987.
Ak1,S.G. and Stojmenovic,I. “Parallel algorithms for generating integer partitions and compositions”. The Journal of Combinatorial Mathematics and Combinatorial Computing, 13:107–120, 1993.
Chan,B. and Akl,S.G. “Generating combinations in parallel”. BIT, 26(1):2–6, 1986.
El-Hage, H. and Stojmenovic,I. “Systolic generation of combinations from arbitrary elements”. Parallel Processing Letters, 2(2/3):241–248, 1992.
Lin,C.J. “A parallel algorithm for generating combinations”. Computers and Mathematics with Applications, 17(12):1523–1533, 1989.
Stojmenovic,I. “On random and adaptive parallel generation of combinatorial objects”. International Journal of Computer Mathematics, 42:125–135, 1992.
Stojmenovic,I. “A simple systolic algorithm for generating combinations in lexicographic order”. Computers and Mathematics with Applications, 24(4):61–64, 1992.
Tsay,J.C. and Lin,C.J. “A systolic design for generating combinations in lexicographic order”. Parallel Computing, 13:119–125, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balbi de Oliveira, P.P. (1997). A simple, multi-architecture, parallel procedure for generating combinations. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_47
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive