Improved upper and lower time bounds for parallel random access machines without simultaneous writes

The time required by a variant of the PRAM (a parallel machine model which consists of sequential processors which communicate by reading and writing into a common shared memory) to compute a certain class of functions called critical functions (which include the Boolean OR of $n$ bits) is studied....

Ausführliche Beschreibung