A Constant-Time Optimal Parallel String-Matching Algorithm

Zvi Galil. A Constant-Time Optimal Parallel String-Matching Algorithm. In Proceedings of the Twenty Fourth Annual ACM Symposium on Theory of Computing, 4-6 May 1992, Victoria, British Columbia, Canada. pages 69-76, ACM, 1992.

Abstract

Abstract is missing.