The following pages link to (Q4633912):
Displaying 11 items.
- The coolest way to generate binary strings (Q489746) (← links)
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- A new universal cycle for permutations (Q1696522) (← links)
- A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
- Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations (Q6170445) (← links)
