Pages that link to "Item:Q5384431"
From MaRDI portal
The following pages link to On a Greedy Algorithm to Construct Universal Cycles for Permutations (Q5384431):
Displaying 5 items.
- Shortened universal cycles for permutations (Q2097185) (← links)
- An explicit universal cycle for the ( <i>n</i> -1)-permutations of an <i>n</i> -set (Q2930325) (← links)
- (Q4036996) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- On a family of universal cycles for multi-dimensional permutations (Q6633546) (← links)
