Communication-efficient randomized consensus

DOI10.1007/s00446-017-0315-1zbMath1482.68050OpenAlexW9664036WikidataQ59522910 ScholiaQ59522910MaRDI QIDQ2075627

James Aspnes, Dan Alistarh, Valerie King, Jared Saia

Publication date: 15 February 2022

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-017-0315-1

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (2)

Brief Announcement: Improved Consensus in Quantum Networks ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust gossiping with an application to consensus
• The correctness proof of Ben-Or's randomized consensus algorithm
• Randomized consensus in expected O(n log n) individual work
• Polylog randomized wait-free consensus
• Lower bounds for distributed coin-flipping and randomized consensus
• On the space complexity of randomized synchronization
• Tight bounds for asynchronous randomized consensus
• Fast randomized consensus using shared memory
• Time and Communication Efficient Consensus for Crash Failures
• Impossibility of distributed consensus with one faulty process
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Sharing memory robustly in message-passing systems
• Unreliable failure detectors for reliable distributed systems
• Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor
• Randomized protocols for asynchronous consensus
• Fast scalable deterministic consensus for crash failures
• Polylogarithmic concurrent data structures from monotone circuits

This page was built for publication: Communication-efficient randomized consensus