Generating Necklaces and Strings with Forbidden Substrings
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
A fast algorithm to generate necklaces with fixed content
Theoretical Computer Science
Generating rooted and free plane trees
ACM Transactions on Algorithms (TALG)
More restrictive Gray codes for necklaces and Lyndon words
Information Processing Letters
Loopless generation of multiset permutations using a constant number of variables by prefix shifts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Computational geometric aspects of rhythm, melody, and voice-leading
Computational Geometry: Theory and Applications
Mathematical features for recognizing preference in sub-saharan african traditional rhythm timelines
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
The geometry of musical rhythm
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
On the degree sequences of uniform hypergraphs
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Theoretical Computer Science
| Hi-index | 0.00 |
A k-ary necklace is an equivalence class of k-ary strings under rotation. A necklace of fixed density is a necklace where the number of zeros is fixed. We present a fast, simple, recursive algorithm for generating (i.e., listing) fixed-density k-ary necklaces or aperiodic necklaces. The algorithm is optimal in the sense that it runs in time proportional to the number of necklaces produced.