Author： Crescenzi P. Penna P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.203, Iss.1, 1998-08, pp. : 51-67
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
The Variance of the height of binary search trees
By Drmota M.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Distances in random digital search trees
By Aguech Rafik Lasmar Nabil Mahmoud Hosam
Acta Informatica, Vol. 43, Iss. 4, 2006-11 ,pp. :
Parallel local search for Steiner trees in graphs
By Verhoeven M.G.A. Severens M.E.M.
Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. :