Elsevier

Journal of Algorithms

Volume 25, Issue 2, November 1997, Pages 321-335
Journal of Algorithms

Regular Article
Generating Multiset Permutations in Constant Time

https://doi.org/10.1006/jagm.1997.0889Get rights and content

Abstract

An algorithm is presented that generates multiset permutations taking constant time between each permutation.

References (9)

  • J.R. Bitner et al.

    Efficient generation of the binary reflected code and its applications

    Comm. ACM

    (1976)
  • J. Chase

    Permutations of a set with repetitions

    Comm. ACM

    (1970)
  • T.C. Hu et al.

    Generating permutations with nondistinct items

    Amer. Math. Monthly

    (1976)
  • S.M. Johnson

    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)

  • Binary bubble languages and cool-lex order

    2012, Journal of Combinatorial Theory. Series A
  • Constant time generation of derangements

    2004, Information Processing Letters
View all citing articles on Scopus

E. F. Beckenbach, Ed.

View full text