Descriptional Complexity of Winning Sets of Regular Languages. - Pierre Marcus; Ilkka Törmä (DCFS, 2020)

Winning Sets of Regular Languages: Descriptional and Computational Complexity. - Pierre Marcus; Ilkka Törmä (J. Autom. Lang. Comb., 2023)

Toward Scalable DNA algorithms. (Vers des algorithmes en ADN passant à l'échelle). - Pierre Marcus (2024)