\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (Q1391774)

From MaRDI portal
Revision as of 19:44, 30 July 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127214633, #quickstatements; #temporary_batch_1722364966119)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
\(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms
scientific article

    Statements

    \(N\)-graphs: Scalable topology and design of balanced divide-and-conquer algorithms (English)
    0 references
    0 references
    23 July 1998
    0 references
    divide-and-conquer
    0 references
    parallel topologies
    0 references
    transformations
    0 references
    transputer
    0 references

    Identifiers