Showing papers by "Uzi Vishkin published in 1987"
01 Jul 1987
TL;DR: In this article, a parallel algorithm for constructing a suffix tree is presented, which runs in O(log n) time and uses n processors, where n is the number of processors.
Abstract: Weiner's [We-73] suffix tree is known to be a powerful tool for string manipulations. We present a parallel algorithm for constructing a suffix tree. The algorithm runs in O(log n) time and uses n processors. We also present applications for designing efficient parallel algorithms for several string problems.
24 citations
TL;DR: Using a recently published parallel prefix sums algorithm the list-ranking algorithm can be adapted to run on a concurrent-read concurrent-write parallel random access machine (CRCW PRAM) almost surely in time O(n/p + log n) using p processors.
7 citations
TL;DR: An algorithm for finding all occurrences of the pattern in the text, each with at most k substitutions, in O(k(m log m + n) time, and requires O(nk) space is presented.
5 citations