36 citations · 62 across the 17 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2018
On Periodicity Lemma for Partial Words
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +1
We investigate the function , called here the threshold function, related to periodicity of partial words (words with holes). The value is defined as the minim…
cs.DM2016
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word
Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter +1
The combinatorics of squares in a word depends on how the equivalence of halves of the square is defined. We consider Abelian squares, parameterized squares, and order-preserving s…
cs.DM2010★ 2 cited
On the maximal sum of exponents of runs in a string
Maxime Crochemore, Marcin Kubica, Jakub Radoszewski +2
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition with a period such that . The exponent of a run is defined as an…