Skip to main content
SpringerLink
Log in

A parallel derangement generation algorithm

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A parallel algorithm to generate allD n derangements ofn distinct elements is presented in this paper. The algorithm requiresO([D n /P]nlogn) time whenP processors are available on a Single Instruction Multiple Data Stream (SIMD) computer.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. G. Akl,A new algorithm for generating derangements, BIT, Vol. 20, pp. 2 (1980).

    Google Scholar 

  2. P. Gupta and G. P. Bhattacharjee,Parallel generation of permutations, Computer J., Vol. 26, pp. 97 (1982).

    Google Scholar 

  3. D. E. Knuth,The Art of Computer Programming, Vol. 3, Addison Wesley, Reading, Mass. (1973).

    Google Scholar 

  4. E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms, Solutions, Manual, Prentice Hall, Englewood Cliffs, New Jersey (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology, 208016, Kanpur, India

    P. Gupta & G. P. Bhattacharjee

  2. Department of Mathematics, Indian Institute of Technology, 721 302, Kharagpur, India

    P. Gupta & G. P. Bhattacharjee

Authors
  1. P. Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. P. Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gupta, P., Bhattacharjee, G.P. A parallel derangement generation algorithm. BIT 29, 14–22 (1989). https://doi.org/10.1007/BF01932701

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932701

CR Categories

Search

Navigation