Pages that link to "Item:Q1044897"
From MaRDI portal
The following pages link to Research problems on Gray codes and universal cycles (Q1044897):
Displaying 9 items.
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set (Q503623) (← links)
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← 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)
- Locating patterns in the de Bruijn torus (Q906472) (← links)
- Recursive reconstruction of piecewise constant signals by minimization of an energy function (Q1673859) (← links)
- Enumerations of universal cycles for \(k\)-permutations (Q2144520) (← links)
- 1-overlap cycles for Steiner triple systems (Q2249792) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)