Author:
Sawada Joe,Hartman Patrick
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference11 articles.
1. Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over GF(2);Cattell;J. Algorithms,2000
2. P. Hartman, J. Sawada, Ranking fixed-density necklaces and Lyndon words, 2016, manuscript.
3. Generating fixed density bracelets of arbitrary base;Karim;Int. J. Comput. Math.,2014
4. Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence;Kociumaka;SIAM J. Discrete Math.,2016
5. Efficient indexing of necklaces and irreducible polynomials over finite fields;Kopparty;Theory Comput.,2016