Title of article
AN EFFICIENT DATA STRUCTURE FOR LATTICE OPERATIONS
Author/Authors
TALAMO، MAURIZIO نويسنده , , VOCCA، PAOLA نويسنده ,
Issue Information
دوماهنامه با شماره پیاپی سال 1999
Pages
-1782
From page
1783
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
graph decomposition , lattices , data structure , reachability , least common ancestors
Journal title
SIAM Journal on Computing
Serial Year
1999
Journal title
SIAM Journal on Computing
Record number
16606
Link To Document