An O(1) Time Algorithm for Generating Multiset Permutations

Tadao Takaoka. An O(1) Time Algorithm for Generating Multiset Permutations. In Alok Aggarwal, C. Pandu Rangan, editors, Algorithms and Computation, 10th International Symposium, ISAAC 99, Chennai, India, December 16-18, 1999, Proceedings. Volume 1741 of Lecture Notes in Computer Science, pages 237-246, Springer, 1999. [doi]

@inproceedings{Takaoka99,
  title = {An O(1) Time Algorithm for Generating Multiset Permutations},
  author = {Tadao Takaoka},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1741/17410237.htm},
  researchr = {https://researchr.org/publication/Takaoka99},
  cites = {0},
  citedby = {0},
  pages = {237-246},
  booktitle = {Algorithms and Computation, 10th International Symposium, ISAAC  99, Chennai, India, December 16-18, 1999, Proceedings},
  editor = {Alok Aggarwal and C. Pandu Rangan},
  volume = {1741},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66916-7},
}