Research problems on Gray codes and universal cycles
From MaRDI portal
Cited in
(10)- A universal cycle for strings with fixed-content (which are also known as multiset permutations)
- Locating patterns in the de Bruijn torus
- Constructing the first (and coolest) fixed-content universal cycle
- 1-overlap cycles for Steiner triple systems
- Recursive reconstruction of piecewise constant signals by minimization of an energy function
- Cut-down de Bruijn sequences
- Generating Gray codes for weak orders in constant amortized time
- Efficient universal cycle constructions for weak orders
- Universal cycle packings and coverings for \(k\)-subsets of an \(n\)-set
- Enumerations of universal cycles for \(k\)-permutations
This page was built for publication: Research problems on Gray codes and universal cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044897)