Abstract We present a (4+ epsilon) approximation algorithm for weighted graph matching
which applies in the semistreaming, sliding window, and MapReduce models; this single …

In this work, we revisit the fundamental and well-studied problem of approximate pattern
matching under edit distance. Given an integer k, a pattern P of length m, and a text T of …

Motivated by a concrete problem and with the goal of understanding the relationship
between the complexity of streaming algorithms and the computational complexity of formal …

We study a variant of the classical membership problem in automata theory, which consists
of deciding whether a given input word is accepted by a given automaton. We do so through …

In this work, we revisit the problem of testing membership in regular languages, first studied
by Alon et al.[1]. We develop a one-sided error property tester for regular languages under …

We study the space complexity of querying regular languages over data streams in the
sliding window model. The algorithm has to answer at any point of time whether the content …

In a recent paper we analyzed the space complexity of streaming algorithms whose goal is
to decide membership of a sliding window to a fixed language. For the class of regular …

A sliding window algorithm receives a stream of symbols and has to output at each time
instant a certain value which only depends on the last $ n $ symbols. If the algorithm is …

Regular expression search is a key primitive in myriads of applications, from web scrapping
to bioinformatics. A regular expression is a formalism for compactly describing a set of …

We study the problem of recognizing regular languages in a variant of the streaming model
of computation, called the sliding window model. In this model, we are given a size of the …