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
On the Generation of Aperiodic and Periodic Necklaces via T-augmentation
Fundamenta Informaticae
Solving necklace constraint problems
Journal of Algorithms
Solving Necklace Constraint Problems
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A note on BSD codes constructed from T-codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the Generation of Aperiodic and Periodic Necklaces via T-augmentation
Fundamenta Informaticae
Generating bracelets with fixed content
Theoretical Computer Science
Boltzmann samplers for v-balanced cycles
Theoretical Computer Science
On a symbolic representation of non-central Wishart random matrices with applications
Journal of Multivariate Analysis
| Hi-index | 0.00 |