Francis Wlazinski

According to our database, Francis Wlazinski authored at least 12 papers between 2000 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

3-anti-power uniform morphisms.

Francis Wlazinski

CoRR, 2023

2017

A uniform cube-free morphism is <i>k</i>-power-free for all integers <i>k</i> ≥ 4.

Francis Wlazinski

RAIRO Theor. Informatics Appl., 2017

2016

Reduction in non-(<i>k</i> + 1)-power-free morphisms.

Francis Wlazinski

RAIRO Theor. Informatics Appl., 2016

2007

Existence of finite test-sets for k-power-freeness of uniform morphisms.

Gwénaël Richomme, Francis Wlazinski

Discret. Appl. Math., 2007

Dynamic Distribution for Data Storage in a P2P Network.

Olivier Soyez, Cyril Randriamaro, Gil Utard, Francis Wlazinski

Proceedings of the Advances in Grid and Pervasive Computing, 2007

2006

Data Distribution in a Peer to Peer Storage System.

Cyril Randriamaro, Olivier Soyez, Gil Utard, Francis Wlazinski

J. Grid Comput., 2006

2005

Data distribution for failure correlation management in a Peer to Peer storage system.

Cyril Randriamaro, Olivier Soyez, Gil Utard, Francis Wlazinski

Proceedings of the 4th International Symposium on Parallel and Distributed Computing (ISPDC 2005), 2005

2004

Overlap-free morphisms and finite test-sets.

Gwénaël Richomme, Francis Wlazinski

Discret. Appl. Math., 2004

2002

Some results on k-power-free morphisms.

Gwénaël Richomme, Francis Wlazinski

Theor. Comput. Sci., 2002

Finite Test-Sets for Overlap-Free Morphisms.

Gwénaël Richomme, Francis Wlazinski

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

A test-set for k-power-free binary morphisms.

Francis Wlazinski

RAIRO Theor. Informatics Appl., 2001

2000

About Cube-Free Morphisms.

Gwénaël Richomme, Francis Wlazinski

Proceedings of the STACS 2000, 2000