About Cube-Free Morphisms. - Gwénaël Richomme; Francis Wlazinski (STACS, 2000)

A test-set for k-power-free binary morphisms. - Francis Wlazinski (RAIRO Theor. Informatics Appl., 2001)

Finite Test-Sets for Overlap-Free Morphisms. - Gwénaël Richomme; Francis Wlazinski (MFCS, 2002)

Some results on k-power-free morphisms. - Gwénaël Richomme; Francis Wlazinski (Theor. Comput. Sci., 2002)

Overlap-free morphisms and finite test-sets. - Gwénaël Richomme; Francis Wlazinski (Discret. Appl. Math., 2004)

Data distribution for failure correlation management in a Peer to Peer storage system. - Cyril Randriamaro; Olivier Soyez; Gil Utard; Francis Wlazinski (ISPDC, 2005)

Data Distribution in a Peer to Peer Storage System. - Cyril Randriamaro; Olivier Soyez; Gil Utard; Francis Wlazinski (J. Grid Comput., 2006)

Dynamic Distribution for Data Storage in a P2P Network. - Olivier Soyez; Cyril Randriamaro; Gil Utard; Francis Wlazinski (GPC, 2007)

Existence of finite test-sets for k-power-freeness of uniform morphisms. - Gwénaël Richomme; Francis Wlazinski (Discret. Appl. Math., 2007)

Reduction in non-(k + 1)-power-free morphisms. - Francis Wlazinski (RAIRO Theor. Informatics Appl., 2016)

A uniform cube-free morphism is k-power-free for all integers k ≥ 4. - Francis Wlazinski (RAIRO Theor. Informatics Appl., 2017)

3-anti-power uniform morphisms. - Francis Wlazinski (CoRR, 2023)