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 242: Permutations of a set with repetitions
Full text PdfPdf (352 KB)
Source
Communications of the ACM archive
Volume 7 ,  Issue 10  (October 1964) table of contents
Page: 585  
Year of Publication: 1964
ISSN:0001-0782
Author
T. W. Sag  Manchester Univ., Manchester, UK
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 3
Additional Information:

cited by   index terms  

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/364888.364916
What is a DOI?

CITED BY  3
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
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

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Permutations and combinations


General Terms:
Algorithms, Design, Performance, Theory


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