Thumbnail
Access Restriction
Subscribed

Author Klein, Rolf ♦ Wood, Derick
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1989
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract It is shown that the external path length of a binary tree is closely related to the ratios of means of certain integers and establish the upper bound External<hsp sp="0.265">Path<hsp sp="0.265">Length≤N<fen lp="par"> <lim align="r">log2N+D -<lim align="r">log2D -0.6623<rp post="par">, .
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1989-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 36
Issue Number 2
Page Count 10
Starting Page 280
Ending Page 289


Open content in new tab

   Open content in new tab
Source: ACM Digital Library