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

From MaRDI portal
Revision as of 00:45, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of deadlock detection in families of planar nets
scientific article

    Statements

    On the complexity of deadlock detection in families of planar nets (English)
    0 references
    0 references
    0 references
    28 April 1999
    0 references
    massively parallel computers
    0 references

    Identifiers