Communication Complexity of Wait-Free Computability in Dynamic Networks (Q5100966): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3045738661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple characterization of asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the message complexity of binary Byzantine agreement under crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the distributed 1-solvable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting in one-hop beeping networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit complexity of breaking and achieving symmetry in chains and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching approximate agreement in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Processor Tasks Are Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5498755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On knowledge and communication complexity in distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Invitation to Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5207884 / rank
 
Normal rank

Latest revision as of 00:59, 30 July 2024

scientific article; zbMATH DE number 7581072
Language Label Description Also known as
English
Communication Complexity of Wait-Free Computability in Dynamic Networks
scientific article; zbMATH DE number 7581072

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references