Author： Breslauer D. Colussi L. Toniolo L.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.29, Iss.1, 1998-10, pp. : 18-67
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A NEW STRING MATCHING ALGORITHM
By AHMED M.
International Journal of Computer Mathematics, Vol. 80, Iss. 7, 2003-07 ,pp. :
Access to resources
Recommend
The Complexity of Parallel Prefix Problems on Small Domains
By Chaudhuri S.P. Radhakrishnan J.
Information and Computation, Vol. 138, Iss. 1, 1997-10 ,pp. :
Simple Optimal String Matching Algorithm
Journal of Algorithms, Vol. 36, Iss. 1, 2000-07 ,pp. :
String matching in O(n+m) quantum time
Journal of Discrete Algorithms, Vol. 1, Iss. 1, 2003-02 ,pp. :