Pages that link to "Item:Q1084396"
From MaRDI portal
The following pages link to An algorithm for generating necklaces of beads in two colors (Q1084396):
Displayed 23 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)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Difference equations with delay (Q2258375) (← links)
- Charm bracelets and their application to the construction of periodic Golay pairs (Q2345628) (← links)
- Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles (Q2635088) (← links)
- Analysis of generating functions for special words and numbers and algorithms for computation (Q2682861) (← links)
- Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence (Q2830442) (← links)
- Witt vectors. Part 1 (Q3053864) (← links)
- De Bruijn Sequences for the Binary Strings with Maximum Density (Q3078396) (← links)
- Computation of k-ary Lyndon words using generating functions and their differential equations (Q5029977) (← links)
- (Q5855731) (← 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)