CREW-PRAM's are a powerful model of parallel computers. Lower bounds for this model are
rather general. Cook, Dwork, and Reischuk upper and lower time bounds for parallel …

A constant-time optimal parallel string-matching algorithm Page 1 A Constant-Time Optimal
Parallel String-Matching Algorithm ZVI GALIL Cokwnbm Urukersip, New York, New York …

We prove lower bounds for the computation of simple functions on generalized versions of
parallel random access machines which allow both concurrent reads and concurrent writes …

We consider the relative power of concurrent-write PRAMs when the number of processors
(and input variables) is fixed at n, and infinite shared memory is allowed. Several different …

We obtain tight bounds on the relative powers of the Priority and Common models of parallel
random-access machines (PRAMs). Specifically we prove that: The Element Distinctness …

We present a significant improvement for parallel integer sorting. On the EREW (exclusive
read exclusive write) PRAM our algorithm sorts n integers in the range 0, 1,..., m-1 in time O …

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number
of Hamming neighbors of a point which differ from it in function value). The structure of …

We present a deterministic parallel algorithm on the EREW PRAM model to verify a
minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m …

Disjunctive systems are a representation of L-domains. They use sequents of the form X⊢ Y,
with X finite and Y pairwise disjoint. We show that for any disjunctive system, its elements …

Reconfigurable bus-based models of parallel computation have been shown to be
extremely powerful, capable of solving several problems in constant time that require …