default search action
Matthieu Rosenfeld
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Matthieu Rosenfeld:
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. Eur. J. Comb. 118: 103924 (2024) - [i16]Matthieu Rosenfeld:
Upper bounds on the average edit distance between two random strings. CoRR abs/2407.18113 (2024) - [i15]Vuong Bui, Matthieu Rosenfeld:
An explicit condition for boundedly supermultiplicative subshifts. CoRR abs/2410.19654 (2024) - 2023
- [c7]Gwénaël Richomme, Matthieu Rosenfeld:
Reconstructing Words Using Queries on Subwords or Factors. STACS 2023: 52:1-52:15 - [i14]Gwénaël Richomme, Matthieu Rosenfeld:
Reconstructing words using queries on subwords or factors. CoRR abs/2301.01571 (2023) - 2022
- [j14]Matthieu Rosenfeld:
Avoiding squares over words with lists of size three amongst four symbols. Math. Comput. 91(337): 2489-2500 (2022) - [j13]Golnaz Badkobeh, Tero Harju
, Pascal Ochem
Avoiding square-free words on free groups. Theor. Comput. Sci. 922: 206-217 (2022) - [i13]Matthieu Rosenfeld:
It is undecidable whether the growth rate of a given bilinear system is 1. CoRR abs/2201.07630 (2022) - 2021
- [j12]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Palindrome Patterns. Electron. J. Comb. 28(1): 1 (2021) - [j11]Matthieu Rosenfeld
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge. Electron. J. Comb. 28(4) (2021) - [j10]Matthieu Rosenfeld
Lower-Bounds on the Growth of Power-Free Languages Over Large Alphabets. Theory Comput. Syst. 65(7): 1110-1116 (2021) - [c6]Matthieu Rosenfeld
The Growth Rate Over Trees Of Any Family Of Sets Defined By A Monadic Second Order Formula Is Semi-computable. SODA 2021: 776-795 - [i12]Matthieu Rosenfeld
Avoiding squares over words with lists of size three amongst four symbols. CoRR abs/2104.09965 (2021) - [i11]Matthieu Rosenfeld:
Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters. CoRR abs/2107.14022 (2021) - 2020
- [j9]Marie Lejeune
Templates for the k-binomial complexity of the Tribonacci word. Adv. Appl. Math. 112 (2020) - [j8]Matthieu Rosenfeld
Another Approach to Non-Repetitive Colorings of Graphs of Bounded Degree. Electron. J. Comb. 27(3): 3 (2020) - [j7]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
The binomial equivalence classes of finite words. Int. J. Algebra Comput. 30(07): 1375-1397 (2020) - [j6]Matthieu Rosenfeld
How far away must forced letters be so that squares are still avoidable? Math. Comput. 89(326): 3057-3071 (2020) - [c5]Florian Lietard
Avoidability of Additive Cubes over Alphabets of Four Numbers. DLT 2020: 192-206 - [i10]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld
On the binomial equivalence classes of finite words. CoRR abs/2001.11732 (2020) - [i9]Matthieu Rosenfeld
The growth rate over trees of any family of set defined by a monadic second order formula is semi-computable. CoRR abs/2004.06508 (2020) - [i8]Matthieu Rosenfeld
Another approach to non-repetitive colorings of graphs of bounded degree. CoRR abs/2006.09094 (2020) - [i7]Matthieu Rosenfeld:
Lower-bounds on the growth of power-free languages over large alphabets. CoRR abs/2008.05192 (2020)
2010 – 2019
- 2019
- [j5]Pascal Ochem, Matthieu Rosenfeld
On Some Interesting Ternary Formulas. Electron. J. Comb. 26(1): 1 (2019) - [j4]Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld:
Bisplit graphs satisfy the Chen-Chvátal conjecture. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [c4]Marie Lejeune, Michel Rigo, Matthieu Rosenfeld:
Templates for the k-Binomial Complexity of the Tribonacci Word. WORDS 2019: 238-250 - [i6]Matthieu Rosenfeld:
How far away must forced letters be so that squares are still avoidable? CoRR abs/1903.04214 (2019) - 2018
- [j3]Michaël Rao, Matthieu Rosenfeld
Avoiding Two Consecutive Blocks of Same Size and Same Sum over ℤ2. SIAM J. Discret. Math. 32(4): 2381-2397 (2018) - [i5]Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld:
Bisplit graphs satisfy the Chen-Chvátal conjecture. CoRR abs/1808.08710 (2018) - 2017
- [b1]Matthieu Rosenfeld:
Avoidability of Abelian Repetitions in Words. (Évitabilité des répétitions abéliennes dans les mots). University of Lyon, France, 2017 - [j2]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. Electron. J. Comb. 24(4): 4 (2017) - [c3]Pascal Ochem, Matthieu Rosenfeld:
On Some Interesting Ternary Formulas. WORDS 2017: 30-35 - [i4]Pascal Ochem, Matthieu Rosenfeld:
On some interesting ternary formulas. CoRR abs/1706.03233 (2017) - 2016
- [j1]Michaël Rao, Matthieu Rosenfeld
Avoidability of long k-abelian repetitions. Math. Comput. 85(302): 3051-3060 (2016) - [c2]Pascal Ochem, Matthieu Rosenfeld
Avoidability of Formulas with Two Variables. DLT 2016: 344-354 - [c1]Matthieu Rosenfeld
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable. MFCS 2016: 81:1-81:11 - [i3]Pascal Ochem, Matthieu Rosenfeld:
Avoidability of formulas with two variables. CoRR abs/1606.03955 (2016) - 2015
- [i2]Michaël Rao, Matthieu Rosenfeld:
Avoidability of long k-abelian repetitions. CoRR abs/1507.02581 (2015) - [i1]Michaël Rao, Matthieu Rosenfeld:
On Mäkelä's Conjectures: deciding if a morphic word avoids long abelian-powers. CoRR abs/1511.05875 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: