ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Algorithm 115: Perm
Full text PdfPdf (725 KB)
Source
Communications of the ACM archive
Volume 5 ,  Issue 8  (August 1962) table of contents
Pages: 434 - 435  
Year of Publication: 1962
ISSN:0001-0782
Author
H. F. Trotter  Princeton Univ., Princeton, NJ
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 46,   Citation Count: 16
Additional Information:

cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/368637.368660
What is a DOI?

CITED BY  16
A. J. Goldstein , A. B. Lesk, Common feature techniques for discrete optimization, Proceedings of the 13th conference on Design automation, p.232-244, June 28-30, 1976, San Francisco, California, United States
G. W. Hill, Algorithm 465: student's t frequency [S14], Communications of the ACM, v.16 n.11, p.690, Nov. 1973
Harley Flanders, Coroutines in Pascal, ACM SIGPLAN Notices, v.18 n.12, December 1983
Gideon Ehrlich, Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations, Journal of the ACM (JACM), v.20 n.3, p.500-513, July 1973
D. B. Dulley , M. L. V. Pitteway, Algorithm 314: Finding a solution of N functional equations in N unknowns, Communications of the ACM, v.10 n.11, p.726, Nov. 1967
N. Brenner, ACM Algorithm 467: Matrix Transposition in Place, Communications of the ACM, v.16 n.11, p.692-694, Nov. 1973
Mohit Kumar Roy, Reflection-free permutations, rosary permutations, and adjacent transposition algorithms, Communications of the ACM, v.16 n.5, p.312-313, May 1973
Kazuaki Harada, Generation of Rosary permutations expressed in Hamiltonian circuits, Communications of the ACM, v.14 n.6, p.373-379, June 1971
Bennet P. Lientz, A comparative evaluation of versions of BASIC, Communications of the ACM, v.19 n.4, p.175-181, April 1976
Robert Sedgewick, Permutation Generation Methods, ACM Computing Surveys (CSUR), v.9 n.2, p.137-164, June 1977
Mohit Kumar Roy, A note on reflection-free permutation enumeration, Communications of the ACM, v.20 n.11, p.823, Nov. 1977
Phillip J. Chase, Algorithm 383: permutations of a set with repetitions [G6], Communications of the ACM, v.13 n.6, p.368-369, June 1970
Vincent Vajnovszki, A loopless algorithm for generating the permutations of a multiset, Theoretical Computer Science, v.307 n.2, p.415-431, 7 October 2003
Tadao Takaoka , Stephen Violich, Combinatorial generation by fusing loopless algorithms, Proceedings of the 12th Computing: The Australasian Theroy Symposium, p.69-77, January 16-19, 2006, Hobart, Australia
Gideon Ehrlich, Algorithm 466: four combinatorial algorithm [G6], Communications of the ACM, v.16 n.11, p.690-691, Nov. 1973
Jean-Luc Baril, More restrictive Gray codes for some classes of pattern avoiding permutations, Information Processing Letters, v.109 n.14, p.799-804, June, 2009
Collaborative Colleagues:
H. F. Trotter: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player