Generating Multiset Permutations in Constant Time
From MaRDI portal
Publication:4373006
DOI10.1006/jagm.1997.0889zbMath0886.68071MaRDI QIDQ4373006
Seymour Lipschutz, James F. Korsh
Publication date: 27 January 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0889
68W10: Parallel algorithms in computer science
Related Items
Loopless Algorithms And SchrÖder Trees, Binary bubble languages and cool-lex order, Loop-free Gray code algorithms for the set of compositions, Generating Gray codes for weak orders in constant amortized time, Gray codes, loopless algorithm and partitions, The coolest way to generate combinations, From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns, A loopless algorithm for generating the permutations of a multiset, Constant time generation of derangements, FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION, Combinatorial isomorphism between Fibonacci classes