Three-Processor Tasks Are Undecidable (Q4229418)

From MaRDI portal
Revision as of 01:32, 27 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1252580
Language Label Description Also known as
English
Three-Processor Tasks Are Undecidable
scientific article; zbMATH DE number 1252580

    Statements

    title
    Three-Processor Tasks Are Undecidable (English)
    0 references
    author
    Eli Gafni
    0 references
    Elias Koutsoupias
    0 references
    publication date
    22 February 1999
    0 references
    zbMATH Keywords
    asynchronous distributed computation
    0 references
    task-solvability
    0 references
    wait-free computation
    0 references
    contractibility problem
    0 references

    Identifiers

    zbMATH DE Number
    1252580
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4229418&oldid=8694029"
      Powered by MediaWiki