Network stability is an important issue that has attracted the attention of many researchers in recent years. Such interest comes from the need to ensure that, as the system runs ...
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
A binary sequence of zeros and ones is called a (d, k)-sequence if it does not contain runs of zeros of length either less than d or greater than k, where d and k are arbitrary, b...
We consider the problem of several users transmitting packets to a base station, and study an optimal scheduling formulation involving three communication layers, namely, the mediu...