A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Optimal parallel algorithms for string matching
1985
Information and Control
Let WRAM [PRAM] be a parallel computer with p processors (RAMs) which share a common memory and are allowed simultaneous reads and writes [only simultaneous reads]. The only type of simultaneous writes allowed is a simultaneous AND: a subset of the processors may write 0 simultaneously into the same memory cell. Let t be the time bound of the computer. We design below families of p~rallel algorithms that solve the string matching problem with inputs of size n (n is the sum of lengths of the
doi:10.1016/s0019-9958(85)80031-0
fatcat:ltclehvuazb5zclomy72mq6udm