Author: Feder T. Megiddo N. Plotkin S.A.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.233, Iss.1, 2000-02, pp. : 297-308
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
Constant-space string-matching in sublinear average time
By Crochemore M. Gasieniec L. Rytter W.
Theoretical Computer Science, Vol. 218, Iss. 1, 1999-04 ,pp. :
Matching user requirements in parallel programming
By Decker K.M. Dvorak J.J. Rehmann R.M. Ruhl R.
Future Generation Computer Systems, Vol. 12, Iss. 4, 1996-12 ,pp. :
Fast parallel string prefix-matching
By Breslauer D.
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :