The minimum path cover problem asks us to find a minimum-cardinality set of paths that
cover all the nodes of a directed acyclic graph (DAG). We study the case when the size k of a …

Given two strings, the longest common subsequence (LCS) problem consists in computing
the length of the longest string that is a subsequence of both input strings. Its generalisation …

This paper studies parallel algorithms for the longest increasing subsequence (LIS)
problem. Let n be the input size and k be the LIS length of the input. Sequentially, LIS is a …

String matching is one of the oldest algorithmic techniques, yet still one of the most
pervasive in computer science. The past 20 years have seen technological leaps in …

In this paper, we consider a variant of the classical algorithmic problem of checking whether
a given word v is a subsequence of another word w. More precisely, we consider the …

We revisit the problem of maintaining the longest increasing subsequence (LIS) of an array
under (i) inserting an element, and (ii) deleting an element of an array. In a recent …

The paper presents parallel algorithms for multiplying implicit simple unit-Monge matrices
(Krusche and Tiskin, PPAM 2009) of size nxn in the EREW PRAM model. We show implicit …

The subject of this thesis is learning and testing properties of mixed quantum states. A mixed
state is described by a density matrix ρ∈ Cd× d. In the standard model, one is given access …

The Permutation Pattern Matching problem, asking whether a pattern permutation π is
contained in a permutation τ, is known to be NP-complete. In this paper we present two …

We consider the canonical generalization of the well-studied Longest Increasing
Subsequence problem to multiple sequences, called k-LCIS: Given k integer sequences …