scientific article; zbMATH DE number 7051269
From MaRDI portal
Publication:4633912
Recommendations
- A loopless algorithm for generating the permutations of a multiset
- Generating Multiset Permutations in Constant Time
- scientific article; zbMATH DE number 1522933
- Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
- Computing and Combinatorics
- Loopless generation of up-down permutations
- scientific article; zbMATH DE number 5855074
- An algorithm for calculation of the number of m-permutations of multisets
- scientific article; zbMATH DE number 2216957
Cited in
(17)- A new universal cycle for permutations
- A loopless algorithm for generating the permutations of a multiset
- A shift Gray code for fixed-content Łukasiewicz words
- Flip-swap languages in binary reflected Gray code order
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION
- Loopless Functional Algorithms
- scientific article; zbMATH DE number 1522933 (Why is no real title available?)
- The coolest way to generate binary strings
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- Constructing the first (and coolest) fixed-content universal cycle
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- Binary bubble languages and cool-lex order
- Constant time and space updates for the sigma-tau problem
- Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
- Generating Gray codes for weak orders in constant amortized time
- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Successor rules for flipping pancakes and burnt pancakes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633912)
