The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654)

From MaRDI portal
Revision as of 00:46, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Cost of Fault Tolerance in Multi-Party Communication Complexity
scientific article

    Statements

    title
    The Cost of Fault Tolerance in Multi-Party Communication Complexity (English)
    0 references
    author
    Binbin Chen
    0 references
    Haifeng Yu
    0 references
    Yuda Zhao
    0 references
    Phillip B. Gibbons
    0 references
    publication date
    12 September 2014
    0 references
    zbMATH Keywords
    aggregate functions
    0 references
    communication complexity
    0 references
    fault tolerance
    0 references
    promise problems
    0 references
    cites work
    Q4228450
    0 references
    Q3546603
    0 references
    Q3826475
    0 references
    Q5417681
    0 references
    Q2707411
    0 references
    Q5501255
    0 references

    Identifiers

    DOI
    10.1145/2597633
    0 references
    Mathematics Subject Classification ID
    68Q15
    0 references
    68M15
    0 references
    68W05
    0 references
    zbMATH DE Number
    6344023
    0 references
    OpenAlex ID
    W2121041710
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3189654&oldid=35411515"
    Powered by MediaWiki