Conditions on input vectors for consensus solvability in asynchronous distributed systems

DOI10.1145/380752.380792zbMath1323.68036OpenAlexW2020925319MaRDI QIDQ5175963

Sergio Rajsbaum, Achour Mostefaoui, Michel Raynal

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380792

zbMATH Keywords

fault-toleranceasynchronous systemsconsensus

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (3)

Low complexity Byzantine-resilient consensus ⋮ Hundreds of impossibility results for distributed computing ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Conditions on input vectors for consensus solvability in asynchronous distributed systems