Pages that link to "Item:Q391391"

The following pages link to A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391):

Displaying 15 items.

• The coolest way to generate binary strings (Q489746) (← links)
• Binary bubble languages and cool-lex order (Q645969) (← links)
• Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
• Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
• A Legendre pair of length 77 using complementary binary matrices with fixed marginals (Q2034994) (← links)
• Counting the decimation classes of binary vectors with relatively prime length and density (Q2114775) (← links)
• Inside the binary reflected gray code: flip-swap languages in 2-gray code order (Q2140470) (← links)
• Ranking and unranking fixed-density necklaces and Lyndon words (Q2272399) (← links)
• Polytopes associated with symmetry handling (Q2414904) (← links)
• Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
• Flip-swap languages in binary reflected Gray code order (Q2676472) (← links)
• De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← 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)