Title of article :
UNIVERSAL LIMIT LAWS FOR DEPTHS IN RANDOM TREES
Author/Authors :
DEVROYE، LUC نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-408
From page :
409
To page :
0
Abstract :
This paper describes the potential suitability of a new family of concrete mixtures for use in protective structures. Two very-high-strength concrete mixtures are discussed and experimental results of penetration studies on one of these are presented. The results are compared to penetration-study results of other, more conventional concrete mixtures, and the advantages of the very-high-strength mixtures are described.
Keywords :
binary search tree , data structures , depth of a node , random tree , law of large numbers , expected time analysis
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16465
Link To Document :
بازگشت