Parallel multiple search

Two arrays of numbers sorted in nondecreasing order are given: an array A of size n and an array B of size m, where n>m. It is required to determine, for every element of A, the smallest element of B (if one exists) that is larger than or equal to it. ...

Parallel algorithms for more general versions of the well known selection and searching problems are formulated. The authors look at these problems when the set of elements can be represented as an n*n matrix with sorted rows and columns. The selection ...

We give fast randomized and deterministic parallel methods for constructing convex hulls in R/sup d/, for any fixed d. Our methods are for the weakest shared-memory model, the EREW PRAM, and have optimal work bounds (with high probability for the ...