Uzi Vishkin

An Efficient Parallel Biconnectivity Algorithm

In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in

An O(logn) parallel connectivity algorithm

O(n + m)

Fast parallel and serial approximate string matching

time and space on a graph of n vertices and m edges. A parallel implementation runs in

Constant Depth Reducibility

O(\log n)

Finding the maximum, merging and sorting in a parallel computation model

time and

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories

O(n + m)

Approximate parallel scheduling. Part I: the basic technique with applications to optimal parallel list ranking in logarithmic time

space using

An O ( n 2 log n ) parallel max-flow algorithm

O(n + m)

Faster optimal parallel prefix sums and list ranking

processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in

Finding the maximum, merging, and sorting in a parallel computation model

O(n^2 /p)