Author： Prodinger H.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.181, Iss.1, 1997-07, pp. : 181-194
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
By Nagaraj S.V.
Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. :
Access to resources
Recommend
A note on binary grammatical codes of trees
By Ehrenfeucht A. ten Pas P. Rozenberg G.
Theoretical Computer Science, Vol. 155, Iss. 2, 1996-03 ,pp. :
Randomized path coloring on binary trees
By Auletta V. Caragiannis I. Kaklamanis C. Persiano P.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Compact searchable static binary trees
By Durgan B.K.
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
The Variance of the height of binary search trees
By Drmota M.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :