Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences. - Damien Jamet; Pierre Popoli; Thomas Stoll (Cryptogr. Commun., 2021)

On the binary digits of n and n2. - Karam Aloui; Damien Jamet; Hajime Kaneko; Steffen Kopecki; Pierre Popoli; Thomas Stoll (Theor. Comput. Sci., 2023)

Additive Word Complexity and Walnut. - Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (FSTTCS, 2024)

On the Pseudorandomness of Parry-Bertrand Automatic Sequences. - Pierre Popoli; Manon Stipulanti (ICTCS, 2024)

Combinatorics on Social Configurations. - Dylan Laplace Mermoud; Pierre Popoli (GASCom, 2024)

Effective Computation of Generalized Abelian Complexity for Pisot Type Substitutive Sequences. - Jean-Michel Couvreur; Martin Delacourt; Nicolas Ollinger; Pierre Popoli; Jeffrey O. Shallit; Manon Stipulanti (CoRR, 2025)

Computing Expansions in Infinitely Many Cantor Real Bases via a Single Transducer. - Émilie Charlier; Pierre Popoli; Michel Rigo (CoRR, 2025)