Author： Szwarcfiter J.L. Navarro G. Baeza-Yates R. Oliveira J.d.S. Cunto W. Ziviani N.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.290, Iss.3, 2003-01, pp. : 1799-1814
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. :
Approximating Optimal Binary Decision Trees
Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. :
New lower bounds on the cost of binary search trees
Theoretical Computer Science, Vol. 156, Iss. 1, 1996-03 ,pp. :
Constant bounds on the moments of the height of binary search trees
By Robson J.M.
Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. :