An Optimal O (log log n) Time Parallel String Matching Algorithm

Dany Breslauer & Zvi Galil
An optimal O (log log n)* time parallel algorithm for string matching on CRCW-PRAM is presented. It improves previous results of [G] and [V].
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.