A Comparison of Combination Generation Methods

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A Comparison of Combination Generation Methods

Full text

Pdf (211 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 7 , Issue 1 (March 1981) table of contents

Pages: 42 - 45

Year of Publication: 1981

ISSN:0098-3500

Author

Selim G. Akl

Department of Computing and Information Science, Queen's University, Kingston, Ont., Canada K7L 3N6

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 56, 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/355934.355937 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	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]
	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]
	4	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]
	5	Jerome Kurtzberg, Algorithm 94: Combination, Communications of the ACM, v.5 n.6, p.344, June 1962 [doi>10.1145/367766.368162]
	6	LEHMER, D.H Teaching combinatorial tricks to a computer. Proc. Syrup. Applied Mathemattcs X, R. Bellman and M. Hal, Jr (Eds), Amer. Math. Soc., Providence, R.I., 1960, pp. 179-193.
	7	LEHMER, D.H. The machine tools of combinatoncs. In Apphed CombmatorialMathemat~cs, E. F Beckenbach (Ed.), Wdey, New York, 1964, pp 5-31.
	8	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]
	9	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]
	10	NIJENHUIS, A., AND WILF, H.S. Comb~natorml Algorithms. Academic Press, New York, 1975, pp. 21-34.
	11	W. H. Payne , F. M. Ives, Combination Generators, ACM Transactions on Mathematical Software (TOMS), v.5 n.2, p.163-172, June 1979 [doi>10.1145/355826.355830]
	12	Edward M. Reingold , Jurg Nievergelt , Narsingh Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall College Div, 1977