The weakest failure detector to solve nonuniform consensus
DOI10.1145/1073814.1073849zbMath1314.68372OpenAlexW2073683596MaRDI QIDQ5177241
Jonathan Eisler, Vassos Hadzilacos, Sam Toueg
Publication date: 10 March 2015
Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073814.1073849
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
This page was built for publication: The weakest failure detector to solve nonuniform consensus
