The following pages link to (Q5202662):
Displayed 12 items.
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- The coolest way to generate binary strings (Q489746) (← links)
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- Re-entrant lines (Q1801807) (← links)
- Gray code for derangements (Q1827847) (← links)
- Strings from linear recurrences and permutations: a gray code (Q2089698) (← links)
- On the low Hamming weight discrete logarithm problem for nonadjacent representations (Q2502171) (← links)
- On a Combinatorial Generation Problem of Knuth (Q5080484) (← links)
- A minimum-change version of the Chung-Feller theorem for Dyck paths (Q5915781) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)