The do-all problem in broadcast networks (Q2787672)

From MaRDI portal
Revision as of 15:19, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The do-all problem in broadcast networks
scientific article

    Statements

    title
    The do-all problem in broadcast networks (English)
    0 references
    DOI
    10.1145/383962.384000
    0 references
    author
    Bogdan S. Chlebus
    0 references
    Dariusz R. Kowalski
    0 references
    Andrzej Lingas
    0 references
    publication date
    4 March 2016
    0 references
    Mathematics Subject Classification ID
    68M14
    0 references
    68Q25
    0 references
    68W15
    0 references
    zbMATH DE Number
    6550322
    0 references
    zbMATH Keywords
    adversary
    0 references
    distributed algorithm
    0 references
    fail-stop failures
    0 references
    independent tasks
    0 references
    lower bound
    0 references
    multiple-access channel
    0 references
    OpenAlex ID
    W2016201384
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2787672&oldid=31139444"
    Powered by MediaWiki