A Dyck sequence is a sequence of opening and closing parentheses (of var...
For any forest G = (V, E) it is possible to orient the edges E so that n...
In this work, we revisit the fundamental and well-studied problem of
app...
Filters (such as Bloom Filters) are data structures that speed up networ...
In population protocols, the underlying distributed network consists of ...
The shift distance 𝗌𝗁(S_1,S_2) between two strings S_1 and S_2
of the sa...
We revisit the k-mismatch problem in the streaming model on a pattern of...
We revisit a fundamental problem in string matching: given a pattern of
...
In the {-1,0,1}-APSP problem the goal is to compute all-pairs shortest
p...
In the SetDisjointness problem, a collection of m sets S_1,S_2,...,S_m
f...
In the 3SUM-Indexing problem the goal is to preprocess two lists of elem...
We consider two closely related problems of text indexing in a sub-linea...
In the kSUM problem we are given an array of numbers a_1,a_2,...,a_n and...
This paper gives a new deterministic algorithm for the dynamic Minimum
S...
We propose a method for efficiently finding all parallel passages in a l...