Algorithm 235: Random permutation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 235: Random permutation

Full text

Pdf (357 KB)

Source

Communications of the ACM archive
Volume 7 , Issue 7 (July 1964) table of contents

Page: 420

Year of Publication: 1964

ISSN:0001-0782

Author

Richard Durstenfeld

General Atomic, San Diego, CA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 97, Citation Count: 7

Additional Information:

references cited by index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/364520.364540 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Henry C. Thacher, Jr., Certification of Algorithm 60: Romberg integration, Communications of the ACM, v.5 n.3, p.168, March 1962 [doi>10.1145/366862.366910]
	2	Karl Heinz Buchner, Certification of Algorithm 60: Romberg integration, Communications of the ACM, v.5 n.5, p.281, May 1962 [doi>10.1145/367710.367750]
	3	Henry E. Fettis, Algorithm 163: modified Hankel function, Communications of the ACM, v.6 n.4, p.161-162, April 1963 [doi>10.1145/366349.366437]
	4	RUTISHAUSER, H. Ausdehnung des Rombergschen Prinzips. Numer. Math. 5 (1963), 48-54.
	5	McKEEMAN, W. M. Personal communication, Sept. 1963.
	6	ENGELI, M. Personal communication, Jan. 1964.
	7	BAUER, F. L., RUTISHAUSER, H., AND STIEFELE, E. New aspects in numerical quadrature. Proc. Symp. Appl. Math 15, 1963, 199-218.

CITED BY 7

	B. J. Oommen , D. T. H. Ng, On generating random permutations with arbitrary distributions, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.27-32, February 21-23, 1989, Louisville, Kentucky
	David R. Musser, On the Efficiency of a Polynomial Irreducibility Test, Journal of the ACM (JACM), v.25 n.2, p.271-282, April 1978
	Robert Sedgewick, Permutation Generation Methods, ACM Computing Surveys (CSUR), v.9 n.2, p.137-164, June 1977
	Lei Tang, Methods for encrypting and decrypting MPEG video data efficiently, Proceedings of the fourth ACM international conference on Multimedia, p.219-229, November 18-22, 1996, Boston, Massachusetts, United States
	A. De Matteis , S. Pagnutti, Pseudorandom permutation, Journal of Computational and Applied Mathematics, v.142 n.2, p.367-375, 15 May 2002
	Kay Connelly , Andrew A. Chien, Breaking the barriers: high performance security for high performance computing, Proceedings of the 2002 workshop on New security paradigms, September 23-26, 2002, Virginia Beach, Virginia
	Jens Gustedt, Efficient sampling of random permutations, Journal of Discrete Algorithms, v.6 n.1, p.125-139, March, 2008