Author： Breslauer D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.137, Iss.2, 1995-01, pp. : 269-278
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 fast algorithm for constructing nearly optimal prefix codes
SOFTWARE:PRACTICE AND EXPERIENCE, Vol. 46, Iss. 10, 2016-10 ,pp. :
Access to resources
Recommend
Approximate string matching for music analysis
Soft Computing, Vol. 8, Iss. 9, 2004-09 ,pp. :
On-line string matching with feedback
By Johansen P.
Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. :
Parallel detection of all palindromes in a string
By Apostolico A. Breslauer D. Galil Z.
Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. :