Author： Restivo A. Silva P.V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.289, Iss.1, 2002-10, pp. : 755-782
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
The meet operation in the lattice of codes
By Bruyere V. Derencourt D. Latteux M.
Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. :
Prefix Computations on Symmetric Multiprocessors
Journal of Parallel and Distributed Computing, Vol. 61, Iss. 2, 2001-02 ,pp. :
New Models of Prefix Adder Topologies
By Burgess Neil
Journal of VLSI Signal Processing, Vol. 40, Iss. 1, 2005-05 ,pp. :
Fast parallel string prefix-matching
By Breslauer D.
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :