1. Lecture Notes in Computer Science;M Ackerman,2009
2. Ackerman, M., Shallit, J.: Efficient enumeration of words in regular languages. Theoret. Comput. Sci. 410(37), 3461–3470 (2009)
3. Adamson, D.: Ranking and unranking $$k$$-subsequence universal words. In: WORDS, p. 47–59. Springer Nature Switzerland (2023). https://doi.org/10.1007/978-3-031-33180-0_4
4. Adamson, D., Deligkas, A., Gusev, V., Potapov, I.: On the hardness of energy minimisation for crystal structure prediction. Fund. Inform. 184(3), 181–203 (2021)
5. Adamson, D., Deligkas, A., Gusev, V.V., Potapov, I.: The complexity of periodic energy minimisation. In: MFCS 2022. LIPIcs, vol. 241, pp. 8:1–8:15 (2022)