Upper bounds on number of steals in rooted trees (Q255260)
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: Upper bounds on number of steals in rooted trees |
scientific article; zbMATH DE number 6552360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on number of steals in rooted trees |
scientific article; zbMATH DE number 6552360 |
Statements
Upper bounds on number of steals in rooted trees (English)
0 references
9 March 2016
0 references
work stealing
0 references
parallel algorithm
0 references
extremal combinatorics
0 references
binomial coefficient
0 references
0.8561875
0 references
0.8558341
0 references
0.8549801
0 references
0 references
0.8531288
0 references
0.8509616
0 references
0.8487828
0 references
0.84800327
0 references
0.8464805
0 references
