• Title of article

    OPTIMAL BIWEIGHTED BINARY TREES AND THE COMPLEXITY OF MAINTAINING PARTIAL SUMS-

  • Author/Authors

    HAMPAPURAM، IIARIPRIYAN نويسنده , , FREDMAN، MICHAEL I,. نويسنده ,

  • Issue Information
    دوماهنامه با شماره پیاپی سال 1999
  • Pages
    0
  • From page
    1
  • 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
    data structures , partial sums , lower bounds
  • Journal title
    SIAM Journal on Computing
  • Serial Year
    1999
  • Journal title
    SIAM Journal on Computing
  • Record number

    16422