KRKamellia Reshadi
Kamellia Reshadi
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Kamellia Reshadi has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dirk Nowotka
Kiel University
1 shared publication Fatemeh Shahriarizadeh
1 shared publication- Florin Manea
Kiel University
1 shared publication - James D. Currie
The University of Winnipeg
1 shared publication - Pamela Fleischmann
Kiel University
1 shared publication - Pascal Ochem
LIRMM, CNRS, Université de Montpellier, France
1 shared publication
Latest Publications
- 21 November 2025
- Published by Springer Nature
- p. 181-195
Topic Extraction from Biographical Interviews
- Open Access
Repetition avoidance in products of factors
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let $\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$ factors of the word $w$. The repetition threshold $\texttt{RT}_i(k)$ is then the infimum of $\texttt{pexp}_i(w)$ over all words $w\in\Sigma^\omega_k$. Mousavi and Shallit obtained that $\texttt{RT}_i(2)=2i$ and $\texttt{RT}_2(3)=\tfrac{13}4$. We show that $\texttt{RT}_i(3)=\tfrac{3i}2+\tfrac14$ if $i$ is even and $\texttt{RT}_i(3)=\tfrac{3i}2+\tfrac16$ if $i$ is odd and $i\ge3$.Open AccessRepetition avoidance in products of factors
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let $\texttt{pexp}_i(w)$ be the supremum of the exponent over the products of $i$ factors of the word $w$. The repetition threshold $\texttt{RT}_i(k)$ is then the infimum of $\texttt{pexp}_i(w)$ over all words $w\in\Sigma^\omega_k$. Mousavi and Shallit obtained that $\texttt{RT}_i(2)=2i$ and $\texttt{RT}_2(3)=\tfrac{13}4$. We show that $\texttt{RT}_i(3)=\tfrac{3i}2+\tfrac14$ if $i$ is even and $\texttt{RT}_i(3)=\tfrac{3i}2+\tfrac16$ if $i$ is odd and $i\ge3$. - 1 September 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 743, 72-82
Unary patterns under permutations
- 1 September 2018
- Published by Elsevier in Theoretical Computer Science
- Vol. 743, 72-82
Unary patterns under permutations