Technical Perspective: Isolating a Matching When Your Coins Go Missing.

The article presents an introduction to a paper regarding a deterministic parallel algorithm for bipartite matching.

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 62; no. 3; pp. 108 - 109
Autor principal: Vishnoi, Nisheeth K.
Formato: Artículo
Publicado: Association for Computing Machinery Mar2019
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=134951015&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 134951015
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00010782
        ACM
      jtl: Communications of the ACM
      issn: 00010782
      maglogo: N
    pubinfo:
      dt: Mar2019
      vid: 62
      iid: 3
      pid: 68
      pub: Association for Computing Machinery
    artinfo:
      ui:
        134951015
        10.1145/3306210
      ppf: 108
      ppct: 1
      formats:
      tig:
        atl: Technical Perspective: Isolating a Matching When Your Coins Go Missing.
      aug:
        au: Vishnoi, Nisheeth K.
        affil: Professor of computer science at Yale University, New Haven, CT, USA
      su:
        Algorithms
        Bipartite graphs
      sug:
        subj:
          Algorithms
          Bipartite graphs
      ab: The article presents an introduction to a paper regarding a deterministic parallel algorithm for bipartite matching.
      pubtype: Periodical
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2019
    holdings:
      @attributes:
        islocal: N