Pages that link to "Item:Q3057811"
From MaRDI portal
The following pages link to A Simple Combinatorial Algorithm for de Bruijn Sequences (Q3057811):
Displaying 14 items.
- Spans of preference functions for de Bruijn sequences (Q423901) (← links)
- A surprisingly simple de Bruijn sequence construction (Q501039) (← links)
- Constructing de Bruijn sequences by concatenating smaller universal cycles (Q1659978) (← links)
- Mapping prefer-opposite to prefer-one de Bruijn sequences (Q1675290) (← links)
- A framework for constructing de Bruijn sequences via simple successor rules (Q1783608) (← links)
- Investigating the discrepancy property of de Bruijn sequences (Q2075526) (← links)
- On greedy algorithms for binary de Bruijn sequences (Q2081554) (← links)
- Cover times for Markov-generated binary sequences of length two (Q2192250) (← links)
- Revisiting the prefer-same and prefer-opposite de Bruijn sequence constructions (Q2220830) (← links)
- An efficient generalized shift-rule for the prefer-max de Bruijn sequence (Q2279980) (← links)
- Generalized de Bruijn words for primitive words and powers (Q2515571) (← links)
- Designing preference functions for de Bruijn sequences with forbidden words (Q2673980) (← links)
- A relation between sequences generated by Golomb's preference algorithm (Q2678989) (← links)
- Nonstandard Analysis of the Behavior of Ergodic Means of Dynamical Systems on Very Big Finite Probability Spaces (Q3460647) (← links)
