Pages that link to "Item:Q1084396"

The following pages link to An algorithm for generating necklaces of beads in two colors (Q1084396):

Displaying 13 items.

• A Gray code for fixed-density necklaces and Lyndon words in constant amortized time (Q391391) (← links)
• Boltzmann samplers for \(v\)-balanced cycles (Q391394) (← links)
• The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)
• The coolest way to generate binary strings (Q489746) (← links)
• The Collatz conjecture and de Bruijn graphs (Q740473) (← links)
• A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
• Lexicographic compositions and de Bruijn sequences (Q1232525) (← links)
• Necklaces of beads in k colors and k-ary de Bruijn sequences (Q1248514) (← links)
• A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
• Constructing de Bruijn sequences with co-lexicographic order: the \(k\)-ary grandmama sequence (Q1645055) (← links)
• Necklaces and Lyndon words in colexicographic and binary reflected Gray code order (Q1679610) (← links)
• Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
• Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)