Generating Multiset Permutations in Constant Time

DOI10.1006/JAGM.1997.0889MaRDI QIDQ4373006zbMATH OpenOpenAlexFDO

Authors James F. Korsh, Seymour Lipschutz

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

zbMATH Keywords

multiset permutations

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited in

(13)

• Loopless Algorithms And SchrÖder Trees
• Loop-free Gray code algorithms for the set of compositions
• A loopless algorithm for generating the permutations of a multiset
• Binary bubble languages and cool-lex order
• Gray codes, loopless algorithm and partitions
• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns
• Counting and Generating Permutations Using Timed Languages
• FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
• Combinatorial isomorphism between Fibonacci classes
• Constant time generation of derangements
• scientific article; zbMATH DE number 7051269 (Why is no real title available?)
• The coolest way to generate combinations
• Generating Gray codes for weak orders in constant amortized time

This page was built for publication: Generating Multiset Permutations in Constant Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373006)