Author： Rytter W.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.299, Iss.1, 2003-04, pp. : 763-774
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. :
Access to resources
Recommend
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. :
A linear-time algorithm to compute a MAD tree of an interval graph
By Dahlhaus E. Dankelmann P. Ravi R.
Information Processing Letters, Vol. 89, Iss. 5, 2004-03 ,pp. :
A linear-time recognition algorithm for P 4 -reducible graphs
By M. Nivat Jamison B. Olariu S.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :