Identifying parallelism in programs with cyclic graphs. (Q1402126)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Identifying parallelism in programs with cyclic graphs. |
scientific article; zbMATH DE number 1967303
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Identifying parallelism in programs with cyclic graphs. |
scientific article; zbMATH DE number 1967303 |
Statements
Identifying parallelism in programs with cyclic graphs. (English)
0 references
19 August 2003
0 references
0.8433526754379272
0 references
0.7278632521629333
0 references
0.7170250415802002
0 references
0.7163068056106567
0 references
