Academic Commons

Reports

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

Breslauer, Dany; Galil, Zvi

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].

Subjects

Files

More About This Work

Academic Units
Computer Science
Publisher
Department of Computer Science, Columbia University
Series
Columbia University Computer Science Technical Reports, CUCS-492-89
Published Here
January 17, 2012