Tight bounds for asynchronous randomized consensus
From MaRDI portal
Publication:3452186
DOI10.1145/1411509.1411510zbMath1325.68031MaRDI QIDQ3452186
Hagit Attiya, Keren Censor-Hillel
Publication date: 11 November 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.7497
68Q25: Analysis of algorithms and problem complexity
68M14: Distributed systems
68W20: Randomized algorithms
68M12: Network protocols
68W15: Distributed algorithms
Related Items
A Tight Space Bound for Consensus, Faster randomized consensus with an oblivious adversary, On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?, Suppression of resilient targets via coordinated swarms, Brief Announcement: Improved Consensus in Quantum Networks, Tight bounds for adopt-commit objects, On the complexity of asynchronous agreement against powerful adversaries, Randomized consensus with regular registers, Communication-efficient randomized consensus, On the round complexity of randomized Byzantine agreement, Sub-logarithmic Test-and-Set against a Weak Adversary, Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
