×

A new method for generating integer compositions in parallel. (English) Zbl 1049.68929


MSC:

68W10 Parallel algorithms in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Akl S. G., The Computer Journal 30 pp 433– (1987)
[2] Akl S. G., Design and Analysis of Parallel Algorithms (1989) · Zbl 0754.68053
[3] Akl S. G., Journal of Combinatorial Mathematics and Combinatorial Computing 13 pp 107– (1993)
[4] Andrew G. E., The Theory of Partitions (1976)
[5] DOI: 10.1007/BF01939357 · Zbl 0602.68057 · doi:10.1007/BF01939357
[6] Dickson L. E., History of the Theory of Numbers, Vol. II Diophantine Analysis (1971)
[7] B. Djokić , M. Miyakawa , S. Sekiguchi , I. Semba , I. Stojmenović , Parallel algorithms for generating subsets and set partitions , Intl. Symp. SIGAL’90, Lecture Notes in Computer Science 450 ( 1990 ), 76 – 85 ( Springer , Berlin ).
[8] DOI: 10.1093/comjnl/31.3.283 · Zbl 0647.68071 · doi:10.1093/comjnl/31.3.283
[9] Hall M., Combinatorial Theory (1967)
[10] Nijenhuis A., Combinatorial Algorithms (1978) · Zbl 0476.68047
[11] Page E. S., An Introduction to Computational Combinatorics (1979)
[12] Reingold E. M., Combinatorial Algorithms Theory and Practice (1977) · Zbl 0367.68032
[13] Semba I., J. of Information Processing 7 pp 41– (1984) · Zbl 0541.68023
[14] H. Shen , An optimal parallel algorithm for generating integer compositions , Res. Rep. No. 62, School of Comput. and Infor. Tech. , Griffith University , Feb. 1993 .
[15] DOI: 10.1007/BF01931658 · Zbl 0696.68073 · doi:10.1007/BF01931658
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.