Parallel algorithms for counting and randomly generating integer partitions

Journal of Parallel and Distributed Computing

Volumn 34, Issue 1, 1996, Pages 29-35

  Sanchis, Laura A ^a   Squire, Matthew B ^b  

^a Assistant Professor in the University Libraries   (United States)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030577980     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0043     Document Type: Article

References (18)

1. 1. Selim G. Akl, The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1989.
2. 2. S. G. Akl and I. Stojmenovic, Parallel algorithms for generating integer partitions and compositions. J. Combin. Math. Combin. Comput. 13 (1993).
3. 3. Richard J. Anderson, Parallel algorithms for generating random permutations on a shared memory machine. In Second Annual ACM Symposium on Parallel Algorithms and Architectures, 1990.
4. 4. T. I. Fenner and G. Loizou, A binary tree representation and related algorithms for generating integer partitions. Comput. J. 23(4), 332-337 (1980).
5. 5. T. I. Fenner and G. Loizou, An analysis of two related loop-free algorithms for generating integer partitions. Acta Inform. 16, 237-252 (1981).
6. 6. T. I. Fenner and G. Loizou, Tree traversal related algorithms for generating integer partitions. SIAM J. Comput. 12(3), 551-564 (1983).
7. 7. Alan Gibbons and Wojciech Rytter, Efficient Parallel Algorithms. Cambridge Univ. Press, Cambridge, UK, 1988.
8. 8. Marshall Hall, Combinatorial Theory. Wiley, New York, 1986.
9. 9. K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing. McGraw-Hill, New York, 1984.
10. 10. C. L. Liu, Introduction to Combinatorial Mathematics. McGraw-Hill New York, 1968.
11. 11. T. V. Narayana, R. M. Mathsen, and J. Sarangi, An algorithm for generating partitions and its applications. J. Combin. Theory 11, 54-61 (1971).
12. 12. Albert Nijenhuis and Herbert S. Wilf, Combinatorial Algorithms. Academic Press, New York, 1978.
13. 13. Vijayan Rajan, R. K. Ghosh, and P. Gupta, An efficient parallel algorithm for random sampling. Inform. Process. Lett. 30, 265-268 (1989).
14. 14. Sanguthevar Rajasekaran and John H. Reif, Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput. 18 (1989).
15. 15. W. Riha and K. R. James, Efficient algorithms for doubly and multiply restricted partitions. Computing 16, 163-168 (1976).
16. 16. Laura A. Sanchis, Counting and generating integer partitions in parallel. In Proceedings of the Fourth International Conference on Computing and Information (ICCI 92), May 1992.
17. 17. Carla D. Savage, Gray code sequences of partitions. J. Algorithms 10, 577-595 (1989).
18. 18. Herbert S. Wilf, Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1986.