Lower bounds for randomized consensus under a weak adversary

DOI10.1145/1400751.1400793zbMath1301.68140OpenAlexW2139896092MaRDI QIDQ2934356

Hagit Attiya, Keren Censor-Hillel

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/64943

zbMATH Keywords

lower bounddistributed computingrandomized algorithmsmessage passingshared memoryconsensus

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) Randomized algorithms (68W20) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement ⋮ Fault-tolerant algorithms for tick-generation in asynchronous logic

This page was built for publication: Lower bounds for randomized consensus under a weak adversary