Faster randomized consensus with an oblivious adversary

DOI10.1145/2332432.2332434zbMath1301.68247OpenAlexW2126708852MaRDI QIDQ5891965

James Aspnes

Publication date: 5 December 2014

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

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

zbMATH Keywords

randomizationshared memoryconsensusoblivious adversary

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Efficient randomized test-and-set implementations ⋮ Faster randomized consensus with an oblivious adversary ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms

This page was built for publication: Faster randomized consensus with an oblivious adversary