50 citations · 86 across the 10 of their papers we have counts for
3 papers · 1 filter
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
A prefix normal word is a binary word with the property that no substring has more s than the prefix of the same length. By proving that the set of prefix normal words is a bubb…
On Combinatorial Generation of Prefix Normal Words
Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták +2
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary…
Algorithms for Jumbled Pattern Matching in Strings
Péter Burcsi, Ferdinando Cicalese, Gabriele Fici +1
The Parikh vector p(s) of a string s is defined as the vector of multiplicities of the characters. Parikh vector q occurs in s if s has a substring t with p(t)=q. We present two no…