Pages that link to "Item:Q1783608"
From MaRDI portal
The following pages link to A framework for constructing de Bruijn sequences via simple successor rules (Q1783608):
Displaying 15 items.
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- Efficient universal cycle constructions for weak orders (Q785821) (← links)
- A universal cycle for strings with fixed-content (which are also known as multiset permutations) (Q832908) (← links)
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- De Bruijn sequences and suffix arrays: analysis and constructions (Q1624990) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- A de Bruijn sequence construction by concatenating cycles of the complemented cycling register (Q1678337) (← links)
- An efficiently generated family of binary de Bruijn sequences (Q2022156) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- (Q4341702) (← links)
- Sparse Kneser graphs are Hamiltonian (Q5006324) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- A BWT-based algorithm for random de Bruijn sequence construction (Q6547923) (← links)
- Cut-down de Bruijn sequences (Q6635080) (← links)
