Combination Generators

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Combination Generators

Full text

Pdf (521 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 5 , Issue 2 (June 1979) table of contents

Pages: 163 - 172

Year of Publication: 1979

ISSN:0098-3500

Authors

W. H. Payne	Computer Science Department, Washington State University, Pullman, WA
F. M. Ives	Mathematics and Computer Science Department, Western Washington State University, Bellingham, WA

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 21, Downloads (12 Months): 109, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

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/355826.355830 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	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 [doi>10.1145/360336.360343]
	2	P. Bratley, Algorithm 306: permutations with repetitions, Communications of the ACM, v.10 n.7, p.450-451, July 1967 [doi>10.1145/363427.363473]
	3	Phillip J. Chase, Algorithm 382: combinations of M out of N objects [G6], Communications of the ACM, v.13 n.6, p.368, June 1970 [doi>10.1145/362384.362502]
	4	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 [doi>10.1145/362384.362503]
	5	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]
	6	Gideon Ehrlich, Algorithm 466: four combinatorial algorithm [G6], Communications of the ACM, v.16 n.11, p.690-691, Nov. 1973 [doi>10.1145/355611.362541]
	7	EVEN, S. Algorithmic Combinatorics. Macmillan, New York, 1973.
	8	Jerome Kurtzberg, Algorithm 94: Combination, Communications of the ACM, v.5 n.6, p.344, June 1962 [doi>10.1145/367766.368162]
	9	LEHMER, D.H. The machine tools of combinatorics. In Apphed Combinatorial Mathemattcs, E.F. Beckenback, Ed., Wiley, New York, 1964.
	10	C. N. Liu , D. T. Tang, Algorithm 452: enumerating combinations of m out of n objects [G6], Communications of the ACM, v.16 n.8, p.485, Aug. 1973 [doi>10.1145/355609.362322]
	11	Charles J. Mifsud, Algorithm 154: combination in lexicographical order, Communications of the ACM, v.6 n.3, p.103, March 1963 [doi>10.1145/366274.366309]
	12	NIJENHUIS, A., AND WILF, H.S Combinatorial Algorithms. Academic Press, New York, 1975.
	13	T. W. Sag, Algorithm 242: Permutations of a set with repetitions, Communications of the ACM, v.7 n.10, p.585, Oct. 1964 [doi>10.1145/364888.364916]
	14	TASG, D T, AND LIU, C N Dtstance-2 cyclic chaining of constant-weight codes. IEEE Trans. Comptrs. C-22, 2 (1973), 176-180.