On the complexity of deadlock detection in families of planar nets (Q1285587)

From MaRDI portal
Revision as of 03:49, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
On the complexity of deadlock detection in families of planar nets
scientific article

    Statements

    title
    On the complexity of deadlock detection in families of planar nets (English)
    0 references
    author
    Bruno Durand
    0 references
    Anne-Cécile Fabret
    0 references
    publication date
    28 April 1999
    0 references
    zbMATH DE Number
    1281081
    0 references
    zbMATH Keywords
    massively parallel computers
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1285587&oldid=26122542"
    Powered by MediaWiki