Mots-clés

Widget extérieur

Nombre de documents

52

CV HAL de Gwenaël Richomme


Autres informations disponible sur ma page web/Other available informations on my web page : ici/here

Remarque : certaines informations sont en double (cause double saisie par co-auteurs)

 


Article dans une revue36 documents

  • Guilhem Gamard, Gwenaël Richomme, Jeffrey Shallit, Taylor J. Smith. Periodicity in rectangular arrays. Information Processing Letters, Elsevier, 2017, 118, pp.58-63. <10.1016/j.ipl.2016.09.011>. <lirmm-01378894>
  • Gwenaël Richomme. Minimal critical exponent of quasiperiodic words. Theoretical Computer Science, Elsevier, 2014, 548, pp.117-122. <10.1016/j.tcs.2014.06.039>. <lirmm-01059541>
  • Fabien Durand, Julien Leroy, Gwenaël Richomme. Do the Properties of an S-adic Representation Determine Factor Complexity?. Journal of Integer Sequences, University of Waterloo, 2013, 16 (2), pp.Art 13.2.6. <https://cs.uwaterloo.ca/journals/JIS/vol16.html>. <lirmm-00797654>
  • Julien Leroy, Gwenaël Richomme. A Combinatorial Proof of S-adicity for Sequences with Linear Complexity. Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2013, 13, pp.article #A5. <http://www.integers-ejcnt.org/vol13.html>. <lirmm-00797658>
  • Gwenaël Richomme, Patrice Séébold. Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms. Theoretical Computer Science, Elsevier, 2012, 428, pp.92-97. <10.1016/j.tcs.2011.12.008>. <lirmm-00797672>
  • Gwenaël Richomme, Patrice Séébold. On Factorially Balanced Sets of Words. Theoretical Computer Science, Elsevier, 2011, 412 (39), pp.5492-5497. <10.1016/j.tcs.2011.06.027>. <lirmm-00616826>
  • Damien Jamet, Geneviève Paquin, Gwenaël Richomme, Laurent Vuillon. On the fixed points of the iterated pseudopalindromic closure operator. Theoretical Computer Science, Elsevier, 2011, 412 (27), pp.2974-2987. <10.1016/j.tcs.2010.03.018>. <hal-00580665>
  • Julien Cassaigne, Gwenaël Richomme, Kalle Saari, Luca Q. Zamboni. Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity. International Journal of Foundations of Computer Science, World Scientific Publishing, 2011, 22 (4), pp.905-920. <10.1142/S0129054111008489>. <lirmm-00601553>
  • Gwenaël Richomme, Kalle Saari, Luca Q. Zamboni. Abelian Complexity of Minimal subshifts. Journal of the London Mathematical Society, London Mathematical Society, 2011, 83 (1), pp.79-95. <10.1112/jlms/jdq063>. <lirmm-00598086>
  • Gwenaël Richomme, Kalle Saari, Luca Q. Zamboni. Balance and Abelian Complexity of the Tribonacci word. Advances in Applied Mathematics, Elsevier, 2010, 45 (2), pp.212-231. <10.1016/j.aam.2010.01.006>. <hal-00599750>
  • Gwenaël Richomme, Kalle Saari, Luca Q. Zamboni. Standard Factors of Sturmian Words. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2010, 44 (1), pp.159-174. <hal-00599748>
  • Richard Groult, Elise Prieur-Gaston, Gwenaël Richomme. Counting distinct palindromes in a word in linear time. Information Processing Letters, Elsevier, 2010, 110, pp.908-912. <10.1016/j.ipl.2010.07.018>. <hal-00507481>
  • Richard Groult, Gwenaël Richomme. Optimality of some algorithms to detect quasiperiodicities. Theoretical Computer Science, Elsevier, 2010, 411 (34-36), pp.3110-3122. <hal-00599751>
  • Amy Glen, Florence Levé, Gwenaël Richomme. Directive words of episturmian words: equivalences and normalization. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2009, 43 (2), pp.299-319. <hal-00599746>
  • Amy Glen, Florence Levé, Gwenaël Richomme. Quasiperiodic and Lyndon episturmian words. Theoretical Computer Science, Elsevier, 2008, 409 (3), pp.578-600. <hal-00599745>
  • Gwenaël Richomme. On morphisms preserving infinite Lyndon words. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (2), pp.89-108. <hal-00599743>
  • Gwenaël Richomme. Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. Theoretical Computer Science, Elsevier, 2007, 380, pp.393-400. <hal-00599742>
  • Florence Levé, Gwenaël Richomme. Quasiperiodic Sturmian words and morphisms. Theoretical Computer Science, Elsevier, 2007, 372 (1), pp.15-25. <hal-00016679>
  • Gwenaël Richomme, Francis Wlazinski. Existence of finite test-sets for k-power-freeness of uniform morphisms. Discrete Applied Mathematics, Elsevier, 2007, 155 (15), pp.2001-2016. <hal-00015775>
  • Gwenaël Richomme. Sudo-Lyndon. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2007, 92, pp.143-149. <hal-00130231>
  • Flavio D'Alessandro, Gwenaël Richomme, Stefano Varrichio. Well quasi-orders and the shuffle closure of finite sets. Theoretical Computer Science, Elsevier, 2007, 377, pp.73-92. <hal-00085839>
  • Gwenaël Richomme, Florence Levé. On a conjecture about finite fixed points of morphisms. Theoretical Computer Science, Elsevier, 2005, 339, pp.103-128. <hal-00599741>
  • Florence Levé, Gwenaël Richomme. Quasiperiodic infinite words: some answers. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2004, 84, pp.128-138. <hal-00599752>
  • Gwenaël Richomme, Francis Wlazinski. Overlap-free morphisms and finite test-sets. Discrete Applied Mathematics, Elsevier, 2004, 143 (1-3), pp.92-109. <hal-00598221>
  • Gwenaël Richomme, Patrice Séébold. Conjectures and results on morphisms generating k-power-free words. International Journal of Foundations of Computer Science, World Scientific Publishing, 2004, 15 (2), pp.307-316. <hal-00598220>
  • Stéphane Fossé, Gwenaël Richomme. Some characterizations of Parikh matrix equivalent binary words. Information Processing Letters, Elsevier, 2004, 92 (2), pp.77-82. <hal-00598222>
  • Gwenaël Richomme. Lyndon morphisms. Bulletin of the Belgian Mathematical Society ¨ Simon Stevin, Belgian Mathematical Society, 2003, 10 (5), pp.761-785. <hal-00598219>
  • Gwenaël Richomme. Conjugacy and episturmian morphisms. Theoretical Computer Science, Elsevier, 2003, 302, pp.1-34. <hal-00598216>
  • Gwenaël Richomme. Some non finitely generated monoids of repetition-free endomorphisms. Information Processing Letters, Elsevier, 2003, 85 (2), pp.61-66. <hal-00598217>
  • Gwenaël Richomme. Some algorithms to compute the conjugates of episturmian morphisms. RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), EDP Sciences, 2003, 37, pp.85-104. <hal-00598218>
  • Gwenaël Richomme, Francis Wlazinski. Some results on k-power-free morphisms. Theoretical Computer Science, Elsevier, 2002, 273, pp.119-142. <hal-00598215>
  • Daniel Kirsten, Gwenaël Richomme. Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids. Theory of Computing Systems, Springer Verlag, 2001, 34, pp.193-217. <10.1007/s00224-001-0006-x>. <hal-00598214>
  • Gwenaël Richomme. Another characterization of Sturmian words (one more). Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 1999, pp.173-175. <hal-00599754>
  • Gwenaël Richomme, Patrice Séébold. Characterization of test-sets for overlap-free morphisms. Discrete Applied Mathematics, Elsevier, 1999, 98, pp.151-157. <10.1016/S0166-218X(99)00118-3>. <hal-00598210>
  • Gwenaël Richomme. Test-words for Sturmian morphisms. Bulletin of the Belgian Mathematical Society ¨ Simon Stevin, Belgian Mathematical Society, 1999, 6 (4), pp.481-489. <hal-00598213>
  • Yves Métivier, Gwenaël Richomme. New results on the star problem in trace monoids. Information and Computation, Elsevier, 1995, 119, pp.240-251. <hal-00307447>

Communication dans un congrès11 documents

  • Guilhem Gamard, Gwenaël Richomme. Determining Sets of Quasiperiods of Infinite Words. Piotr Faliszewski; Anca Muscholl; Rolf Niedermeier. MFCS: Mathematical Foundations of Computer Science, Aug 2016, Cracovie, Poland. 41st International Symposium on Mathematical Foundations of Computer Science, 58, pp.40:1-40:13, 2016, Leibniz International Proceedings in Informatics (LIPIcs). <http://mfcs.ki.agh.edu.pl>. <10.4230/LIPIcs.MFCS.2016.40>. <lirmm-01369373>
  • Guilhem Gamard, Gwenaël Richomme. Coverability in Two Dimensions. Adrian Horia Dediu; Enrico Formenti; Carlos Martín-Vide; Bianca Truthe. LATA: Language and Automata Theory and Applications, Mar 2015, Nice, France. Springer, 9th International Conference on Language and Automata Theory and Applications, 8977, 2015, LNCS. <http://grammars.grlmc.com/lata2015/>. <lirmm-01180026>
  • Michelangelo Bucci, Gwenaël Richomme. Left greedy palindromic length. Journées Montoises d'Informatique Théorique, Sep 2014, Nancy, France. 2014, 15e Journées Montoises d'Informatique Théorique. <http://jm2014.sciencesconf.org/>. <lirmm-01232103>
  • Florence Levé, Gwenaël Richomme. On Quasiperiodic Morphisms. WORDS: Combinatorics on Words, Sep 2013, Turku, Finland. 9th International Conference on Combinatorics on Words, WORDS 2013, LNCS (8079), pp.181-192, 2013, <10.1007/978-3-642-40579-2_20>. <hal-00816766>
  • Fabien Durand, Julien Leroy, Gwenaël Richomme. Some Examples and Counter-Examples About the S-Adic Conjecture. Numération 2011, Jun 2011, Liège, Belgium. Actes locaux, 2011, <http://www.cant.ulg.ac.be/num2011/>. <lirmm-00604422>
  • Richard Groult, Elise Prieur, Gwenaël Richomme. Counting different palindromes in a word in linear time. Journées GdT COMATEGE du GDR IM, 2010, Montpellier, France. <hal-00516721>
  • Geneviève Paquin, Gwenaël Richomme, Damien Jamet, Laurent Vuillon. On the fixed points of the iterated pseudopalindromic closure operator. 2nd Canadian Discrete and Algorithmic Mathematics Conference - CanaDAM 2009, 2009, Montreal, Canada. <hal-00391429>
  • Gwenaël Richomme. A local balance property of episturmian words. Development in Language Theory (DLT'2007), Jul 2007, Turku, Finland. 4588, pp.371-381, 2007. <hal-00130229v2>
  • Gwenaël Richomme. Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words. S. Brlek, C. Reutenauer. 2005, pp.341-351, 2005, Publications du LaCIM numéro 36. <hal-00013457>
  • Yves Métivier, Gwenaël Richomme, Pierre-André Wacrenier. Computing the closure of sets of words under partial commutations. International Colloquium on Automata, Languages and Programming (ICALP), 1995, Hungary. Springer, 944, pp.75-86, 1995, Lecture notes in computer science. <hal-00307445>
  • Yves Métivier, Gwenaël Richomme. On the star operation and the finite power property in free partially commutative monoid. Annual Symposium on Theoretical Aspects of Computer Science (STACS), 1994, France. Springer, 775, pp.341-352, 1994, Lecture notes in computer science. <hal-00307443>

Ouvrage (y compris édition critique et traduction)1 document

  • Fabien Durand, Gwenaël Richomme. Special issue 13th "Journées Montoises d'Informatique Théorique". EDP Sciences, 46 (1), pp.1-200, 2012, RAIRO Theoretical Informatics and Applications, <10.1051/ita/2012004>. <lirmm-00799906>

Pré-publication, Document de travail2 documents

  • Guilhem Gamard, Gwenaël Richomme. Comparison of Coverability and Multi-Scale Coverability in One and Two Dimensions. Article soumis en revue. 2015. <lirmm-01176543>
  • Fabien Durand, Julien Leroy, Gwenaël Richomme. Towards a statement of the S-adic conjecture through examples. 25. 2012. <hal-00724788>

Rapport2 documents

  • Gwenaël Richomme, Patrice Séébold. On Factorially Balanced Sets of Words. [Research Report] RR-10028, Lirmm. 2010. <lirmm-00507782>
  • Gwenaël Richomme, Patrice Séébold. Completing a Combinatorial Proof of the Rigidity of Sturmian Words Generated by Morphisms. [Research Report] RR-10030, Lirmm. 2010. <lirmm-00512187>