Author： Derencourt D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.163, Iss.1, 1996-08, pp. : 145-160
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
Conway's problem for three-word sets
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
Three-element codes with one d-primitive word
Acta Informatica, Vol. 41, Iss. 2-3, 2004-12 ,pp. :
An algorithm for suffix stripping
By Porter M.F.
Program: electronic library & information systems, Vol. 40, Iss. 3, 2006-07 ,pp. :
On updating suffix tree labels
By Ferragina P. Grossi R. Montangero M.
Theoretical Computer Science, Vol. 201, Iss. 1, 1998-07 ,pp. :
Prefix Computations on Symmetric Multiprocessors
Journal of Parallel and Distributed Computing, Vol. 61, Iss. 2, 2001-02 ,pp. :