Author： Fan Chen-Ming
Publisher： Taylor & Francis Ltd
ISSN： 0020-7160
Source： International Journal of Computer Mathematics, Vol.85, Iss.5, 2008-05, pp. : 703-715
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
Access to resources
Recommend
OPTIMAL PREFIX CODES AND HUFFMAN CODES
International Journal of Computer Mathematics, Vol. 80, Iss. 6, 2003-06 ,pp. :
Axiomatizing Prefix Iteration with Silent Steps
By Aceto L. van Glabbeek R. Fokkink W. Ingolfsdottir A.
Information and Computation, Vol. 127, Iss. 1, 1996-05 ,pp. :
The Complexity of the
By Skodinis K.
Information and Computation, Vol. 168, Iss. 2, 2001-08 ,pp. :
On the Comparison Complexity of the String Prefix-Matching Problem
By Breslauer D. Colussi L. Toniolo L.
Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. :