4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2018★ 1 cited
Periodicity in Data Streams with Wildcards
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer +1
We investigate the problem of detecting periodic trends within a string of length , arriving in the streaming model, containing at most wildcard characters, where $k=o(n…
cs.DS2017★ 4 cited
Streaming Periodicity with Mismatches
Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer +1
We study the problem of finding all -periods of a length- string , presented as a data stream. is said to have -period if its prefix of length differs fro…
cs.DS2013★ 1 cited
Palindrome Recognition In The Streaming Model
Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn +1
In the Palindrome Problem one tries to find all palindromes (palindromic substrings) in a given string. A palindrome is defined as a string which reads forwards the same as backwar…