The fundamental problem of minimum computation has several well studied generalizations such as prefix minima, range minima, and all nearest smaller values ...

The fundamental problem of minimum computation has several well-studied generalizations such as prefix minima, range minima, and all nearest smaller values ...

1. Partition the input array of size n into n ' subarrays. · 2. (Solve local problems.) Preprocess e a c h subarray for r a n g e minima computation. · 3. C ...

FAST PARALLEL ALGORITHMS FOR. MINIMUM AND RELATED PROBLEMS WITH. SMALL INTEGER INPUTS. OMER BERKMAN. Department of Computer Science, King's College London, ...

Apr 25, 1995 · Recent papers introduced parallel algorithms for these problems when the n input elements are given from an integer domain [1.s], obtaining O(lg ...

Recent papers introduced parallel algorithms for these problems when the n input elements are given from an integer domain [1..s], obtaining O(lglglgs) running ...

Bibliographic details on Fast parallel algorithms for minimum and related problems with small integer inputs.

The fundamental problem of minimum computation has several well-studied generalizations such as prefix minima, range minima, and all nearest smaller values ...

Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs, O. Berkman and Y. Matias, Parallel Processing Letters, 5(2):223-230, 1995.

Fast parallel algorithms for minimum and related problems with small integer inputs. IPPS, 1995 (with Yossi Matias). On the power of randomization for the ...