The extended BG-simulation and the characterization of t-resiliency
From MaRDI portal
Publication:5172701
DOI10.1145/1536414.1536428zbMath1304.68133OpenAlexW2170544967MaRDI QIDQ5172701
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1536414.1536428
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)
Related Items (8)
An Equivariance Theorem with Applications to Renaming ⋮ Tight Bounds for Asynchronous Renaming ⋮ Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Of choices, failures and asynchrony: the many faces of set agreement ⋮ An equivariance theorem with applications to renaming ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Wait-freedom with advice
This page was built for publication: The extended BG-simulation and the characterization of t-resiliency
