The following pages link to (Q4252356):
Displaying 12 items.
- Perfect necklaces (Q308973) (← links)
- An algorithm for generating necklaces of beads in two colors (Q1084396) (← links)
- A fast algorithm to generate necklaces with fixed content (Q1400003) (← links)
- Generating bracelets with fixed content (Q1939284) (← links)
- A Pascal-like bound for the number of necklaces with fixed density (Q2420574) (← links)
- Finding the largest fixed-density necklace and Lyndon word (Q2628279) (← links)
- Generating bracelets in constant amortized time (Q2784451) (← links)
- Generating fixed density bracelets of arbitrary base (Q2875290) (← links)
- Algorithms for Necklace Maps (Q2950591) (← links)
- Generating necklaces (Q4020354) (← links)
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES (Q4907692) (← links)
- An Efficient Algorithm for Generating Necklaces with Fixed Density (Q4943839) (← links)