A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)

J. Sawada, A. Williams. A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations). In Anna Lubiw, Mohammad R. Salavatipour, editors, Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings. Volume 12808 of Lecture Notes in Computer Science, pages 599-612, Springer, 2021. [doi]

@inproceedings{SawadaW21,
  title = {A Universal Cycle for Strings with Fixed-Content (Which Are Also Known as Multiset Permutations)},
  author = {J. Sawada and A. Williams},
  year = {2021},
  doi = {10.1007/978-3-030-83508-8_43},
  url = {https://doi.org/10.1007/978-3-030-83508-8_43},
  researchr = {https://researchr.org/publication/SawadaW21},
  cites = {0},
  citedby = {0},
  pages = {599-612},
  booktitle = {Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings},
  editor = {Anna Lubiw and Mohammad R. Salavatipour},
  volume = {12808},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-030-83508-8},
}