Optimal Parallel Algorithms for String Matching

Zvi Galil
Let WRAM [PRAM] be a parallel computer with p processors (RAM's) 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: several processors may write O simultaneously into the same memory cell. Let t be the time bound of the computer. We design below families of parallel algorithms that solve the string matching problem with inputs of size n...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.