We introduce and study online versions of weighted matching problems in metric spaces.
We present a simple 2k− 1 competitive algorithm for online minimum weighted bipartite …

We show that a unit-cost RAM with a word length of w bits can sort n integers in the range O..
2W–1 in O (n log log n) time, for arbitrary wz log n, a significant improvement over the bound …

A major challenge for computer science in the 1990s is to determine the extent to which
general purpose parallel computing can be achieved. The goal is to deliver both scalable …

Integer sorting is a fundamental problem in computer science. This paper studies parallel
integer sort both in theory and in practice. In theory, we show tighter bounds for a class of …

We show thatnintegers in the range 1,…, ncan be sorted stably on an EREW PRAM usingO
(t) time andO (n (log n log log n+(logn) 2/t)) operations, for arbitrary givent⩾ lognloglogn, and …

Parallel radix sorting has been extensively studied in the literature for decades. However,
the most efficient implementations require auxiliary memory proportional to the input size …

Abstract An O (rn)-work 0 (log4 rn)-time common CRCWPRAM algorithm for constructing the
suffix tree of a string s of length m drawn from any fixed alphabet set is obtained. The …

The su x tree is a compacted trie that stores all su xes of a given text string. This data
structure has been intensively employed in pattern matching on strings and trees, with a …

There are several serial algorithms for suffix tree construction which run in linear time, but
the number of operations in the only parallel algorithm available, due to Apostolic …

We address the problem of sorting n integers each in the range {0,..., m-1} in parallel on the
PRAM model of computation. We present a randomized algorithm that runs with very high …