Algorithm 383: permutations of a set with repetitions [G6]

Authors:
Phillip J. Chase
Affiliations:
Department of Defense, Fort Meade, MD
Venue:
Communications of the ACM
Year:
1970

Citing 4
Cited 2

Algorithm 382: combinations of M out of N objects [G6]

Communications of the ACM
Algorithm 306: permutations with repetitions

Communications of the ACM
Algorithm 242: Permutations of a set with repetitions

Communications of the ACM
Algorithm 115: Perm

Communications of the ACM

Combination Generators

ACM Transactions on Mathematical Software (TOMS)
A loopless algorithm for generating the permutations of a multiset

Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics

Quantified Score

Hi-index	48.22

Visualization

Abstract