Fast deterministic consensus in a noisy environment

DOI10.1145/343477.343631zbMath1314.68364OpenAlexW1971982888MaRDI QIDQ5176791

James Aspnes

Publication date: 3 March 2015

Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) 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)

Related Items (2)

Switched PIOA: parallel composition via distributed scheduling ⋮ Randomized protocols for asynchronous consensus

This page was built for publication: Fast deterministic consensus in a noisy environment