Generating Multiset Permutations in Constant Time
- 1 November 1997
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 25 (2) , 321-335
- https://doi.org/10.1006/jagm.1997.0889
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- On Rotations and the Generation of Binary TreesJournal of Algorithms, 1993
- Generating Permutations with Nondistinct ItemsThe American Mathematical Monthly, 1976
- Efficient generation of the binary reflected gray code and its applicationsCommunications of the ACM, 1976
- Algorithm 382: combinations of M out of N objects [G6]Communications of the ACM, 1970
- Generation of permutations by adjacent transpositionMathematics of Computation, 1963