B.Y.O.C (1,342 Times and Counting).

The article discusses the advantages of reusing software code for commonly needed algorithms in the field of computer programming. It refers to the principle of Occam's razor, noting that a few algorithms held in an easily accessible code library are preferable to a plethora of distinct algorithms w...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 54; no. 3; pp. 56 - 59
Autor principal: KAMP, POUL-HENNING
Formato: Artículo
Publicado: Association for Computing Machinery Mar2011
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=59423969&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 59423969
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Mar2011
      vid: 54
      iid: 3
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        59423969
        10.1145/1897852.1897870
      ppf: 56
      ppct: 3
      formats:
      tig:
        atl: B.Y.O.C (1,342 Times and Counting).
      aug:
        au: KAMP, POUL-HENNING
      su:
        Algorithms
        Coding theory
        Computer programming
        Cryptography
        Computer software development
        Computer logic
      sug:
        subj:
          Algorithms
          Coding theory
          Computer programming
          Cryptography
          Computer software development
          Computer logic
      ab: The article discusses the advantages of reusing software code for commonly needed algorithms in the field of computer programming. It refers to the principle of Occam's razor, noting that a few algorithms held in an easily accessible code library are preferable to a plethora of distinct algorithms which all do the same thing. Although copyright issues and the multiplicity of programming languages ensure a certain degree of multiplicity, it is noted that this may be optimal, as it provides competition and incentive for further improvement. An example involving cryptographic algorithms is provided.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2011
    holdings:
      @attributes:
        islocal: N