Another approach to non-repetitive colorings of graphs of bounded degree M Rosenfeld
arXiv preprint arXiv:2006.09094, 2020
39 2020 Avoidability of long 𝑘-abelian repetitions M Rao, M Rosenfeld
Mathematics of Computation 85 (302), 3051-3060, 2016
18 2016 Avoiding Two Consecutive Blocks of Same Size and Same Sum over M Rao, M Rosenfeld
SIAM Journal on Discrete Mathematics 32 (4), 2381-2397, 2018
16 2018 The binomial equivalence classes of finite words M Lejeune, M Rigo, M Rosenfeld
International Journal of Algebra and Computation 30 (07), 1375-1397, 2020
12 2020 Avoiding squares over words with lists of size three amongst four symbols M Rosenfeld
Mathematics of Computation 91 (337), 2489-2500, 2022
10 2022 Templates for the k-binomial complexity of the Tribonacci word M Lejeune, M Rigo, M Rosenfeld
Advances in Applied Mathematics 112, 101947, 2020
10 2020 Bisplit graphs satisfy the Chen-Chv\'atal conjecture L Beaudou, G Kahn, M Rosenfeld
Discrete Mathematics & Theoretical Computer Science 21, 2019
10 2019 The growth rate over trees of any family of sets defined by a monadic second order formula is semi-computable M Rosenfeld
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
8 2021 Avoidability of formulas with two variables P Ochem, M Rosenfeld
International Conference on Developments in Language Theory, 344-354, 2016
8 2016 Reconstructing words using queries on subwords or factors G Richomme, M Rosenfeld
arXiv preprint arXiv:2301.01571, 2023
6 2023 Avoidability of abelian repetitions in words M Rosenfeld
Université de Lyon, 2017
6 2017 Every binary pattern of length greater than 14 is Abelian-2-avoidable M Rosenfeld
41st International Symposium on Mathematical Foundations of Computer Science …, 2016
6 2016 It is undecidable whether the growth rate of a given bilinear system is 1 M Rosenfeld
Linear Algebra and its Applications 651, 131-143, 2022
5 2022 Finding lower bounds on the growth and entropy of subshifts over countable groups M Rosenfeld
arXiv preprint arXiv:2204.00394, 2022
5 2022 Avoidability of additive cubes over alphabets of four numbers F Lietard, M Rosenfeld
International Conference on Developments in Language Theory, 192-206, 2020
5 2020 On some interesting ternary formulas P Ochem, M Rosenfeld
International Conference on Combinatorics on Words, 30-35, 2017
5 2017 Avoidability of palindrome patterns P Ochem, M Rosenfeld
The Electronic Journal of Combinatorics, P1. 4-P1. 4, 2021
4 2021 Avoiding or limiting regularities in words P Ochem, M Rao, M Rosenfeld
Sequences, Groups, and Number Theory, 177-212, 2018
4 2018 Avoiding square-free words on free groups G Badkobeh, T Harju, P Ochem, M Rosenfeld
Theoretical Computer Science 922, 206-217, 2022
3 2022 Bounding the number of M Rosenfeld
arXiv preprint arXiv:1904.02943, 2019
2 2019 
Pascal OchemLIRMM - CNRSAdresse e-mail validée de lirmm.fr
