Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Richomme, Gw{\'e}na{\"e}l"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Gwénaël Richomme
,
Patrice Séébold
Theoretical Computer Science
428
, 2012, pp. 92-97
On factorially balanced sets of words
Gwénaël Richomme
,
Patrice Séébold
Theoretical Computer Science
412
(39), 2011, pp. 5492-5497
Counting distinct palindromes in a word in linear time
Richard Groult
,
Élise Prieur
,
Gwénaël Richomme
Information Processing Letters
110
(20), 2010, pp. 908-912
Well quasi-orders generated by a word-shuffle rewriting
Flavio D'Alessandro
,
Gwénaël Richomme
,
Stefano Varricchio
Theoretical Computer Science
377
(1-3), 2007, pp. 73-92
New results on the star problem in trace monoids
Yves Métivier
,
Gwénaël Richomme
Information and Computation
119
(2), 1995, pp. 240-251
On the star operation and the finite power property in free partially commutative monoids
Yves Métivier
,
Gwénaël Richomme
Lecture Notes in Computer Science
775
, 1994, pp. 341-352