Upper bounds on number of steals in rooted trees (Q255260)

From MaRDI portal
Revision as of 12:44, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Upper bounds on number of steals in rooted trees
scientific article

    Statements

    title
    Upper bounds on number of steals in rooted trees (English)
    0 references
    author
    Charles E. Leiserson
    0 references
    Tao B. Schardl
    0 references
    Warut Suksompong
    0 references
    publication date
    9 March 2016
    0 references
    Mathematics Subject Classification ID
    68W10
    0 references
    68M20
    0 references
    68Q10
    0 references
    68R05
    0 references
    zbMATH DE Number
    6552360
    0 references
    zbMATH Keywords
    work stealing
    0 references
    parallel algorithm
    0 references
    extremal combinatorics
    0 references
    binomial coefficient
    0 references
    OpenAlex ID
    W2043762736
    0 references
    arXiv ID
    1706.03184
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q255260&oldid=33288093"
    Powered by MediaWiki