Skip Navigation

The Computer Journal 1983 26(2):97-105; doi:10.1093/comjnl/26.2.97
© 1983 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (18)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Gupta, P.
Right arrow Articles by Bhattacherjee, G. P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Parallel Generation of Permutations

P. Gupta * and G. P. Bhattacherjee *

Department of Mathematics, Indian Institute of Technology, Kharagpur, India

A parallel algorithm to generate all the nPr distinct permutations of r items out of n distinct items is presented in this paper. The algorithm requires O([nPr/P {rciel}rlog2r) units of time when P processors are available in the SIMD computer.

Received October 1981.

* Department of Mathematics, Indian Institute of Technology, Kharagpur, India


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.