Regular ArticleGenerating Multiset Permutations in Constant Time☆
References (9)
- et al.
Efficient generation of the binary reflected code and its applications
Comm. ACM
(1976) Permutations of a set with repetitions
Comm. ACM
(1970)- et al.
Generating permutations with nondistinct items
Amer. Math. Monthly
(1976) Generation of permutations by adjacent transpositions
Math. Comput.
(1963)
There are more references available in the full text version of this article.
Cited by (29)
Generating Gray codes for weak orders in constant amortized time
2020, Discrete MathematicsBinary bubble languages and cool-lex order
2012, Journal of Combinatorial Theory. Series AThe coolest way to generate combinations
2009, Discrete MathematicsConstant time generation of derangements
2004, Information Processing LettersA loopless algorithm for generating the permutations of a multiset
2003, Theoretical Computer ScienceLoopless generation of up-down permutations
2001, Discrete Mathematics
- ☆
E. F. Beckenbach, Ed.
Copyright © 1997 Academic Press. All rights reserved.