In this paper, we study the fundamental problem of maintaining a dynamic collection of
strings under the following operations:• make_string–add a string of constant length,• concat …

Since sensor nodes normally have limited resources in terms of energy, bandwidth and
computation capability, efficiency is a key design goal in sensor network research. As one of …

We consider finding a pattern of length mm in a compacted (linear-size) trie storing strings
over an alphabet of size σ σ. In static tries, we achieve O (m+\lg\lg σ) O (m+ lg lg σ) …

Many problems in processor scheduling, deamortization, and buffer management can be
modeled as single-and multi-processor cup games. At the beginning of the single-processor …

The problem of Text Indexing is a fundamental algorithmic problem in which one wishes to
preprocess a text in order to quickly locate pattern queries within the text. In the ever …

In each step of the cup game on n cups, a filler distributes up to 1–∊ water among the cups,
and then an emptier removes 1 unit of water from a single cup. The emptier's goal is to …

Maximal Common Subsequences (MCSs) between two strings X and Y are subsequences
of both X and Y that are maximal under inclusion. MCSs relax and generalize the well …

The cup game on n cups is a multi-step game with two players, a filler and an emptier. At
each step, the filler distributes 1 unit of water among the cups, and then the emptier selects a …

In each step of the p-processor cup game on n cups, a filler distributes up to p units of water
among the cups, subject only to the constraint that no cup receives more than 1 unit of water; …

We discuss how string sorting algorithms can be parallelized on modern multi-core shared
memory machines. As a synthesis of the best sequential string sorting algorithms and …