On the complexity of deadlock detection in families of planar nets (Q1285587): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:35, 31 January 2024
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
28 April 1999
0 references
massively parallel computers
0 references
