29 citations · 49 across the 12 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012
Fewest repetitions in infinite binary words
Golnaz Badkobeh, Maxime Crochemore
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is the quotient of its length…
cs.DS2012★ 29 cited
Binary Jumbled String Matching for Highly Run-Length Compressible Texts
Golnaz Badkobeh, Gabriele Fici, Steve Kroon +1
The Binary Jumbled String Matching problem is defined as: Given a string over of length and a query , with non-negative integers, decide whether …