A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634)
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: A tight analysis and near-optimal instances of the algorithm of Anderson and Woll |
scientific article; zbMATH DE number 2132505
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight analysis and near-optimal instances of the algorithm of Anderson and Woll |
scientific article; zbMATH DE number 2132505 |
Statements
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (English)
0 references
9 February 2005
0 references
Analysis of shared-memory algorithms
0 references
PRAM simulations
0 references
Certified Write-All
0 references
0 references
0 references
0.8557699
0 references
0.8473973
0 references
0.8420335
0 references
0.83900666
0 references
0.8384999
0 references
0.8348752
0 references
0.8348752
0 references
0.8347821
0 references
0 references
