Communication complexity of consensus in anonymous message passing systems

DOI10.3233/FI-2015-1181zbMATH Open1335.68019OpenAlexW1640529447MaRDI QIDQ2805428FDOQ2805428

Authors: Emanuele G. Fusco, Andrzej Pelc 

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1181

Recommendations

• Fast scalable deterministic consensus for crash failures
• On the complexity of asynchronous gossip
• scientific article; zbMATH DE number 4058843
• On the optimal space complexity of consensus for anonymous processes
• Time and Communication Efficient Consensus for Crash Failures

zbMATH Keywords

algorithmconsensusanonymous networksmessage complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited In (6)

• Message terminating algorithms for anonymous rings of unknown size
• A characterization of oblivious message adversaries for which consensus is solvable
• Title not available (Why is that?)
• Who are you? Secure identities in single hop ad hoc networks
• Reaching consensus in ad-hoc diffusion networks
• Exact communication costs for consensus and leader in a tree

This page was built for publication: Communication complexity of consensus in anonymous message passing systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805428)