Title of article :
THE HEIGHT AND SIZE OF RANDOM HASH TREES AND RANDOM PEBBLED HASH TREES
Author/Authors :
DEVROYE، LUC نويسنده ,
Issue Information :
دوماهنامه با شماره پیاپی سال 1999
Pages :
-1214
From page :
1215
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 :
probabilistic analysis , hashing with chaining , hash tables , N-trees , random hash trees , expected complexity , data structures
Journal title :
SIAM Journal on Computing
Serial Year :
1999
Journal title :
SIAM Journal on Computing
Record number :
16554
Link To Document :
بازگشت