Matthieu Rosenfeld

ORCID

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 35

Top Venues

University of Lyon, France (PHD)

Education History

University of Lyon, France

PHD

Publications

Matthieu Rosenfeld
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. Eur. J. Comb. 118 (2024)
Matthieu Rosenfeld
Upper bounds on the average edit distance between two random strings. CoRR (2024)
Gwénaël Richomme, Matthieu Rosenfeld
Reconstructing Words Using Queries on Subwords or Factors. STACS (2023)
Gwénaël Richomme, Matthieu Rosenfeld
Reconstructing words using queries on subwords or factors. CoRR (2023)
Matthieu Rosenfeld
Avoiding squares over words with lists of size three amongst four symbols. Math. Comput. 91 (337) (2022)
Matthieu Rosenfeld
It is undecidable whether the growth rate of a given bilinear system is 1. CoRR (2022)
Golnaz Badkobeh, Tero Harju, Pascal Ochem, Matthieu Rosenfeld
Avoiding square-free words on free groups. Theor. Comput. Sci. 922 (2022)
Matthieu Rosenfeld
Avoiding squares over words with lists of size three amongst four symbols. CoRR (2021)
Matthieu Rosenfeld
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets. Theory Comput. Syst. 65 (7) (2021)
Matthieu Rosenfeld
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge. Electron. J. Comb. 28 (4) (2021)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Palindrome Patterns. Electron. J. Comb. 28 (1) (2021)
Matthieu Rosenfeld
The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. SODA (2021)
Matthieu Rosenfeld
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. CoRR (2021)
Matthieu Rosenfeld
The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable. CoRR (2020)
Matthieu Rosenfeld
Another approach to non-repetitive colorings of graphs of bounded degree. CoRR (2020)
Florian Lietard, Matthieu Rosenfeld
Avoidability of Additive Cubes over Alphabets of Four Numbers. DLT (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30 (07) (2020)
Matthieu Rosenfeld
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree. Electron. J. Comb. 27 (3) (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
On the binomial equivalence classes of finite words. CoRR (2020)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
-binomial complexity of the Tribonacci word. Adv. Appl. Math. 112 (2020)
Matthieu Rosenfeld
How far away must forced letters be so that squares are still avoidable? Math. Comput. 89 (326) (2020)
Matthieu Rosenfeld
Lower-bounds on the growth of power-free languages over large alphabets. CoRR (2020)
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
Bisplit graphs satisfy the Chen-Chvátal conjecture. Discret. Math. Theor. Comput. Sci. 21 (1) (2019)
Matthieu Rosenfeld
How far away must forced letters be so that squares are still avoidable? CoRR (2019)
Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. Electron. J. Comb. 26 (1) (2019)
Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
Templates for the k-Binomial Complexity of the Tribonacci Word. WORDS (2019)
Michaël Rao, Matthieu Rosenfeld
. SIAM J. Discret. Math. 32 (4) (2018)
Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld
Bisplit graphs satisfy the Chen-Chvátal conjecture. CoRR (2018)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. Electron. J. Comb. 24 (4) (2017)
Pascal Ochem, Matthieu Rosenfeld
On some interesting ternary formulas. CoRR (2017)
Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. WORDS (2017)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of formulas with two variables. CoRR (2016)
Michaël Rao, Matthieu Rosenfeld
-abelian repetitions. Math. Comput. 85 (302) (2016)
Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. DLT (2016)
Matthieu Rosenfeld
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. MFCS (2016)
Michaël Rao, Matthieu Rosenfeld
Avoidability of long k-abelian repetitions. CoRR (2015)
Michaël Rao, Matthieu Rosenfeld
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. CoRR (2015)

Matthieu Rosenfeld.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Matthieu Rosenfeld