The topology of distributed adversaries (Q360277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-013-0189-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming in an asynchronous environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Derivation of Semi-Synchronous Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the time to reach agreement in the presence of timing uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / 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: Shellable and Cohen-Macaulay Partially Ordered Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Immediate atomic snapshots and fast renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Equivariance Theorem with Applications to Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for <i>k</i> -set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disagreement power of an adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Authenticated Algorithms for Byzantine Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-by-round fault detectors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Processor Tasks Are Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set consensus using arbitrary objects (preliminary version) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic spans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concurrent Computing and Shellable Complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topology of shared-memory adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulations and reductions for colorless tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Axiomatic Approach to Computing the Connectivity of Synchronous and Asynchronous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying synchronous and asynchronous message-passing models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algebraic topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interprocess communication. I: Basic formalism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast set agreement in the presence of timing uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Layered Analysis of Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3827224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522742 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-013-0189-9 / rank
 
Normal rank

Latest revision as of 15:22, 9 December 2024

scientific article
Language Label Description Also known as
English
The topology of distributed adversaries
scientific article

    Statements

    The topology of distributed adversaries (English)
    0 references
    0 references
    0 references
    26 August 2013
    0 references
    colorless tasks
    0 references
    distributed computability
    0 references
    combinatorial topology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers