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 466: four combinatorial algorithm [G6]
Full text PdfPdf (1.16 MB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 11  (November 1973) table of contents
Pages: 690 - 691  
Year of Publication: 1973
ISSN:0001-0782
Author
Gideon Ehrlich  Weizmann Institute of Science, Rehovot, Israel
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 19,   Citation Count: 7
Additional Information:

references   cited by   index terms   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/355611.362541
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
1. Johnson, S.N. Generation of permutations by adjacent transformations. Math. Comp. 17 (1963), 282-285.
2
H. F. Trotter, Algorithm 115: Perm, Communications of the ACM, v.5 n.8, p.434-435, Aug. 1962  [doi>10.1145/368637.368660]
3
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  [doi>10.1145/321765.321781]

CITED BY  7
W. H. Payne , F. M. Ives, Combination Generators, ACM Transactions on Mathematical Software (TOMS), v.5 n.2, p.163-172, June 1979
Robert Sedgewick, Permutation Generation Methods, ACM Computing Surveys (CSUR), v.9 n.2, p.137-164, June 1977
James R. Bitner , Gideon Ehrlich , Edward M. Reingold, Efficient generation of the binary reflected gray code and its applications, Communications of the ACM, v.19 n.9, p.517-521, Sept. 1976
Clement W. H. Lam , Leonard H. Soicher, Three new combination algorithms with the minimal change property, Communications of the ACM, v.25 n.8, p.555-559, Aug 1982
Selim G. Akl, A Comparison of Combination Generation Methods, ACM Transactions on Mathematical Software (TOMS), v.7 n.1, p.42-45, March 1981
F. M. Ives, Permutation enumeration: four new permutation algorithms, Communications of the ACM, v.19 n.2, p.68-72, Feb. 1976
W. H. Payne , K. L. McMillen, Orderly enumeration of nonsingular binary matrices applied to text encryption, Communications of the ACM, v.21 n.4, p.259-263, April 1978

INDEX TERMS

Keywords:
permutations and combinations

Collaborative Colleagues:
Gideon Ehrlich: 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