On the lower bound for parallel string matching

References

• Breslauer , D. and Galil , Z. 1992 . A lower bound for parallel string matching . SI AM Journal on Computing , 21 : 856 – 862 .
   Google Scholar
• Breslauer , D. and Galil , Z. 1990 . An optimal 0 (log log n) parallel string matching algorithm . SI AM Journal on Computing , 19 : 1051 – 1058 .
   Web of Science ®Google Scholar
• Galil , Z. 1985 . Optimal parallel algorithms for string matching . Information and control , 67 : 69 – 76 .
   Google Scholar
• Galley , C. 1994 . On the lower bound for parallel string matching . Intern.J.Computer Maths , 53 : 129 – 133 .
   Web of Science ®Google Scholar
• Rosser , J. and Schoenfleld , L. 1962 . Approximate formulas for some functions of prime numbers . Illinois Journal of Mathematics , 6 : 64 – 94 .
   Google Scholar
• Vishkin , U. 1985 . Optimal parallel pattern matching in strings . Information and Control , 67 : 91 – 113 .
   Google Scholar