A loopless algorithm for generating the permutations of a multiset

Bitner, 1976, Efficient generation of the binary reflected Gray code and its applications, Comm. ACM, 19, 517, 10.1145/360336.360343 Canfield, 1995, A loop-free algorithm for generating linear extensions of a poset, Order, 12, 57, 10.1007/BF01108590 Chase, 1970, Algorithm 383, Comm. ACM, 13, 368, 10.1145/362384.362502 Eades, 1984, An algorithm for generating subsets of fixed size with a strong minimal change property, Inform. Process. Lett., 19, 131, 10.1016/0020-0190(84)90091-7 Ehrlich, 1973, Loopless algorithms for generating permutations, combinations, and other combinatorial configurations, J. Assoc. Comput. Mach., 20, 500, 10.1145/321765.321781 Er, 1984, On generating the n-ary reflected Gray codes, IEEE Trans. Comput., 33, 739, 10.1109/TC.1984.5009360 Ko, 1992, Generating permutations of a bag by interchanges, Inform. Process. Lett., 41, 263, 10.1016/0020-0190(92)90170-Z Korsh, 1997, Generating multiset permutations in constant time, J. Algorithms, 25, 321, 10.1006/jagm.1997.0889 E. Lucas, Théorie de nombres, Gauthier-Villard, Paris, 1891 (repr. Blanchard, 1961). Mateescu, 1998, Shuffle on trajectories, Theoret. Comput. Sci., 197, 1, 10.1016/S0304-3975(97)00163-1 F. Ruskey, Simple combinatorial Gray codes constructed by reversing sublists, in: ISAAC Conf., Lecture Notes in Computer Science, Vol. 762, 1993, pp. 201–208. F. Ruskey, Combinatorial Object Server, http://www.theory.cs.uvic.ca/~cos/cos.html. F. Ruskey, Combinatorial Generation, book under preparation. Savage, 1997, A survey of combinatorial Gray codes, SIAM Rev., 39, 605, 10.1137/S0036144595295272 T. Takaoka, An O(1) time algorithm for generating multiset permutations, Issac 99, Lecture Notes in Computer Science, Vol. 1741, 1999, pp. 237–246. Trotter, 1962, Perm (Algorithm 115), Comm. ACM, 5, 434, 10.1145/368637.368660 Vajnovszki, 1998, On the Loopless Generation of Binary Tree Sequences, Inform. Process. Lett., 68, 113, 10.1016/S0020-0190(98)00155-0 Walsh, 2000, Loop-free sequencing of bounded integer compositions, J. Combin. Math. Combin. Comput., 33, 323 Walsh, 2001, Gray codes for involutions, J. Combin. Math. Combin. Comput., 36, 95 Williamson, 1985