The following pages link to (Q4504909):
Displaying 12 items.
- Generalized algorithm for restricted weak composition generation (Q387319) (← links)
- A unified approach to algorithms generating unrestricted and restricted integer compositions and integer partitions (Q655178) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
- A CAT algorithm for generating permutations with a fixed number of inversions (Q1007583) (← links)
- Gray code for derangements (Q1827847) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- An efficient Gray code algorithm for generating all permutations with a given major index (Q2447540) (← links)
- Tracing Isomanifolds in \(\mathbb{R}\) <sup><i>d</i></sup> in Time Polynomial in <i>d</i> using Coxeter–Freudenthal–Kuhn Triangulations (Q5890033) (← links)
- New algorithms and analyses for sum-preserving encryption (Q6135423) (← links)
