Showing papers by "Uzi Vishkin published in 1989"
TL;DR: Given a text of lenght n, a pattern of length m and an integer k, this work presents parallel and serial algorthms for finding all occurrences of the pattern in the text with at most k differences.
353 citations
01 Feb 1989
TL;DR: It is established that several problems are highly parallelizable and for each of these problems, an optimal 0 (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCWPRAM models is designed.
Abstract: of Results. We establish that several problems are highly parallelizable. For each of these problems, we design an optimal 0 (loglogn ) time parallel algorithm on the Common CRCW PRAM model which is the weakest among the CRCW PRAM models. These problems include: 0 all nearest smaller values, l preprocessing for answering range maxima queries, l several problems in Computational Geometry, l string matching. Until recently, such algorithms were known only for finding the maximum and merging.
126 citations
30 Oct 1989
TL;DR: The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree), which uses a generalization of this * functional and applies it to functions other than log.
Abstract: The authors introduce a fundamentally novel parallel data structure, called recursive *-tree (star tree). For its definition, they use a generalization of this * functional and apply it to functions other than log. Using recursion in the spirit of the inverse-Akermann function, they derive recursive *-trees. The recursive *-tree data structure leads to a new design paradigm for parallel algorithms. The paradigm allows for unusually fast parallel computations that need only constant time, using an optimal number of processors under the assumption that a very small number of processors can write simultaneously, each into different bits of the same word. >
69 citations
Proceedings Article•
01 Jan 1989
4 citations
01 Jan 1989
TL;DR: General purpose parallel computation raises two main challenges: how to build parallel computers and how to use them effectively.
Abstract: General purpose parallel computation raises two main challenges:
1.
How to build parallel computers?
2.
How to use them effectively?
2 citations