Given a signed permutation on n elements, we need to sort it with the
fe...
The fundamental question considered in algorithms on strings is that of
...
In this work, we consider the problem of pattern matching under the dyna...
A Dyck sequence is a sequence of opening and closing parentheses (of var...
In this work, we revisit the fundamental and well-studied problem of
app...
In the problem of the longest common substring with k mismatches we are
...
In the problem of Generalised Pattern Matching (GPM)
[STOC'94, Muthukris...
The popular 3-SUM conjecture states that there is no strongly subquadrat...
We study the problem of recognizing regular languages in a variant of th...
We consider the problem of computing distance between a pattern of lengt...
In this paper we study lower bounds for the fundamental problem of text
...
In the k-mismatch problem we are given a pattern of length m and a text
...
We revisit the fundamental problem of dictionary look-up with mismatches...
We consider a range of simply stated dynamic data structure problems on
...
In the longest common substring problem we are given two strings of leng...