Combining shared-coin algorithms

DOI10.1016/j.jpdc.2009.08.005zbMath1233.68226OpenAlexW1979352615MaRDI QIDQ666060

Hagit Attiya, James Aspnes, Keren Censor-Hillel

Publication date: 7 March 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2009.08.005

zbMATH Keywords

distributed computingrandomized algorithmsshared memoryconsensusshared coins

Mathematics Subject Classification ID

Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

Unnamed Item ⋮ Faster randomized consensus with an oblivious adversary

Cites Work

• Randomized consensus in expected O(n log n) individual work
• Fast randomized consensus using shared memory
• Impossibility of distributed consensus with one faulty process
• Time- and Space-Efficient Randomized Consensus
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• Randomized wait-free concurrent objects (extended abstract)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining shared-coin algorithms