Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188)
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: Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms |
scientific article; zbMATH DE number 4195148
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms |
scientific article; zbMATH DE number 4195148 |
Statements
Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (English)
0 references
1991
0 references
approximate parallel scheduling
0 references
list ranking
0 references
logarithmic time parallel
0 references
PRAM
0 references
algorithm
0 references
0 references
0.904994249343872
0 references
0.8653751015663147
0 references
0.8579654097557068
0 references
0.8564521670341492
0 references
0.8534793257713318
0 references
