Pages that link to "Item:Q1186163"

The following pages link to Generating permutations with given ups and downs (Q1186163):

Displaying 23 items.

• A multi-stack method for the fast generation of permutations with minimal length increasing subsequences (Q294635) (← links)
• Generating alternating permutations lexicographically (Q583885) (← links)
• Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
• Counting and generating permutations in regular classes (Q727971) (← links)
• Some considerations on permutation trees (Q799671) (← links)
• Transposition generation of alternating permutations (Q807622) (← links)
• Gray code for permutations with a fixed number of cycles (Q879329) (← links)
• Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
• Generating restricted classes of involutions, Bell and Stirling permutations (Q966165) (← links)
• More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
• Gray codes, loopless algorithm and partitions (Q1040787) (← links)
• Enumerating pairs of permutations with the same up-down form (Q1059077) (← links)
• On zigzag permutations and comparisons of adjacent elements (Q1063028) (← links)
• Generating stable permutations (Q1087542) (← links)
• Signatures des permutations et des mots extraits. (Signatures of permutations and extracted words) (Q1093634) (← links)
• Generating permutations of a bag by interchanges (Q1197979) (← links)
• Ranking and unranking permutations in linear time (Q1603397) (← links)
• From enumerating to generating: a linear time algorithm for generating 2D lattice paths with a given number of turns (Q1736650) (← links)
• On the frequencies of patterns of rises and falls (Q1782889) (← links)
• Gray code for derangements (Q1827847) (← links)
• Signatures of strings (Q1950426) (← links)
• Permutations with ascending and descending blocks (Q2380446) (← links)
• Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)