An efficient algorithm for generating necklaces with fixed density
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A fast algorithm to generate necklaces with fixed content
Theoretical Computer Science
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
Binary bubble languages and cool-lex order
Journal of Combinatorial Theory Series A
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Theoretical Computer Science
| Hi-index | 0.00 |