• Title of article

    SPACE-EFFICIENT ROUTING TABLES FOR ALMOST ALL NETWORKS AND THE INCOMPRESSIBILITY METHOD

  • Author/Authors

    BUHRMAN، HARRY نويسنده , , HOEPMAN، JAAP-HENK نويسنده , , VITNYI، PAUL نويسنده ,

  • Issue Information
    دوماهنامه با شماره پیاپی سال 1999
  • Pages
    -1413
  • From page
    1414
  • 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
    Kolmogorov , complexity , Random graphs , average-case complexity , space complexity , incompressibility method , computer networks , compact routing tables , routing algorithms
  • Journal title
    SIAM Journal on Computing
  • Serial Year
    1999
  • Journal title
    SIAM Journal on Computing
  • Record number

    16579

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=16579