Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Gideon Ehrlich

doi:10.1145/321765.321781

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Gideon Ehrlich

Weizmann Institute of Science

Research output: Contribution to journal › Article › peer-review

156 Scopus citations

Abstract

The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.

Original language	English
Pages (from-to)	500-513
Number of pages	14
Journal	Journal of the ACM
Volume	20
Issue number	3
DOIs	https://doi.org/10.1145/321765.321781
State	Published - 1 Jul 1973
Externally published	Yes

Keywords

Gray code
algorithm
combinations
compositions
generating
iff program
listing
loopless algorithims
ordering
partitions
permutations

Access to Document

10.1145/321765.321781

Cite this

@article{f005d223df704f79a8ce5aca8e8115eb,

title = "Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations",

abstract = "The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.",

keywords = "Gray code, algorithm, combinations, compositions, generating, iff program, listing, loopless algorithims, ordering, partitions, permutations",

author = "Gideon Ehrlich",

year = "1973",

month = jul,

day = "1",

doi = "10.1145/321765.321781",

language = "אנגלית",

volume = "20",

pages = "500--513",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

AU - Ehrlich, Gideon

PY - 1973/7/1

Y1 - 1973/7/1

N2 - The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.

AB - The purpose of this work is to find a method for building loopless algorithms for listing combinatorial items, like partitions, permutations, combinations. Gray code, etc. Algorithms for the above sequence are detailed in full.

KW - Gray code

KW - algorithm

KW - combinations

KW - compositions

KW - generating

KW - iff program

KW - listing

KW - loopless algorithims

KW - ordering

KW - partitions

KW - permutations

UR - http://www.scopus.com/inward/record.url?scp=84976666253&partnerID=8YFLogxK

U2 - 10.1145/321765.321781

DO - 10.1145/321765.321781

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84976666253

SN - 0004-5411

VL - 20

SP - 500

EP - 513

JO - Journal of the ACM

JF - Journal of the ACM

IS - 3

ER -

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this