BibTeX records: Francis Wlazinski

download as .bib file

@article{DBLP:journals/corr/abs-2312-14514,
  author       = {Francis Wlazinski},
  title        = {3-anti-power uniform morphisms},
  journal      = {CoRR},
  volume       = {abs/2312.14514},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2312.14514},
  doi          = {10.48550/ARXIV.2312.14514},
  eprinttype    = {arXiv},
  eprint       = {2312.14514},
  timestamp    = {Thu, 18 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2312-14514.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Wlazinski17,
  author       = {Francis Wlazinski},
  title        = {A uniform cube-free morphism is \emph{k}-power-free for all integers
                  \emph{k} {\(\geq\)} 4},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {51},
  number       = {4},
  pages        = {205--216},
  year         = {2017},
  url          = {https://doi.org/10.1051/ita/2017015},
  doi          = {10.1051/ITA/2017015},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Wlazinski17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Wlazinski16,
  author       = {Francis Wlazinski},
  title        = {Reduction in non-(\emph{k} + 1)-power-free morphisms},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {50},
  number       = {1},
  pages        = {3--20},
  year         = {2016},
  url          = {https://doi.org/10.1051/ita/2016006},
  doi          = {10.1051/ITA/2016006},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Wlazinski16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RichommeW07,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  title        = {Existence of finite test-sets for k-power-freeness of uniform morphisms},
  journal      = {Discret. Appl. Math.},
  volume       = {155},
  number       = {15},
  pages        = {2001--2016},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.dam.2007.04.024},
  doi          = {10.1016/J.DAM.2007.04.024},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RichommeW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gpc/SoyezRUW07,
  author       = {Olivier Soyez and
                  Cyril Randriamaro and
                  Gil Utard and
                  Francis Wlazinski},
  editor       = {Christophe C{\'{e}}rin and
                  Kuan{-}Ching Li},
  title        = {Dynamic Distribution for Data Storage in a {P2P} Network},
  booktitle    = {Advances in Grid and Pervasive Computing, Second International Conference,
                  {GPC} 2007, Paris, France, May 2-4, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4459},
  pages        = {555--566},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72360-8\_47},
  doi          = {10.1007/978-3-540-72360-8\_47},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/gpc/SoyezRUW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/grid/RandriamaroSUW06,
  author       = {Cyril Randriamaro and
                  Olivier Soyez and
                  Gil Utard and
                  Francis Wlazinski},
  title        = {Data Distribution in a Peer to Peer Storage System},
  journal      = {J. Grid Comput.},
  volume       = {4},
  number       = {3},
  pages        = {311--321},
  year         = {2006},
  url          = {https://doi.org/10.1007/s10723-006-9038-4},
  doi          = {10.1007/S10723-006-9038-4},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/grid/RandriamaroSUW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccgrid/RandriamaroSUW05,
  author       = {Cyril Randriamaro and
                  Olivier Soyez and
                  Gil Utard and
                  Francis Wlazinski},
  title        = {Data distribution in a peer to peer storage system},
  booktitle    = {5th International Symposium on Cluster Computing and the Grid (CCGrid
                  2005), 9-12 May, 2005, Cardiff, {UK}},
  pages        = {284--291},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/CCGRID.2005.1558566},
  doi          = {10.1109/CCGRID.2005.1558566},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ccgrid/RandriamaroSUW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispdc/RandriamaroSUW05,
  author       = {Cyril Randriamaro and
                  Olivier Soyez and
                  Gil Utard and
                  Francis Wlazinski},
  title        = {Data distribution for failure correlation management in a Peer to
                  Peer storage system},
  booktitle    = {4th International Symposium on Parallel and Distributed Computing
                  {(ISPDC} 2005), 4-6 July 2005, Lille, France},
  pages        = {242--249},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/ISPDC.2005.20},
  doi          = {10.1109/ISPDC.2005.20},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ispdc/RandriamaroSUW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0512051,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  title        = {Existence of finite test-sets for k-power-freeness of uniform morphisms},
  journal      = {CoRR},
  volume       = {abs/cs/0512051},
  year         = {2005},
  url          = {http://arxiv.org/abs/cs/0512051},
  eprinttype    = {arXiv},
  eprint       = {cs/0512051},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-cs-0512051.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RichommeW04,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  title        = {Overlap-free morphisms and finite test-sets},
  journal      = {Discret. Appl. Math.},
  volume       = {143},
  number       = {1-3},
  pages        = {92--109},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.dam.2003.10.005},
  doi          = {10.1016/J.DAM.2003.10.005},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/RichommeW04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RichommeW02,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  title        = {Some results on k-power-free morphisms},
  journal      = {Theor. Comput. Sci.},
  volume       = {273},
  number       = {1-2},
  pages        = {119--142},
  year         = {2002},
  url          = {https://doi.org/10.1016/S0304-3975(00)00437-0},
  doi          = {10.1016/S0304-3975(00)00437-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RichommeW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RichommeW02,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  editor       = {Krzysztof Diks and
                  Wojciech Rytter},
  title        = {Finite Test-Sets for Overlap-Free Morphisms},
  booktitle    = {Mathematical Foundations of Computer Science 2002, 27th International
                  Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2420},
  pages        = {605--614},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45687-2\_50},
  doi          = {10.1007/3-540-45687-2\_50},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/RichommeW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/Wlazinski01,
  author       = {Francis Wlazinski},
  title        = {A test-set for k-power-free binary morphisms},
  journal      = {{RAIRO} Theor. Informatics Appl.},
  volume       = {35},
  number       = {5},
  pages        = {437--452},
  year         = {2001},
  url          = {https://doi.org/10.1051/ita:2001104},
  doi          = {10.1051/ITA:2001104},
  timestamp    = {Mon, 25 May 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ita/Wlazinski01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RichommeW00,
  author       = {Gw{\'{e}}na{\"{e}}l Richomme and
                  Francis Wlazinski},
  editor       = {Horst Reichel and
                  Sophie Tison},
  title        = {About Cube-Free Morphisms},
  booktitle    = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
                  Science, Lille, France, February 2000, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1770},
  pages        = {99--109},
  publisher    = {Springer},
  year         = {2000},
  url          = {https://doi.org/10.1007/3-540-46541-3\_8},
  doi          = {10.1007/3-540-46541-3\_8},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/RichommeW00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics