Exact communication costs for consensus and leader in a tree
From MaRDI portal
Publication:1827285
DOI10.1016/S1570-8667(03)00024-8zbMath1074.68003MaRDI QIDQ1827285
Sergio Rajsbaum, Shlomo Moran, Yefim Dinitz
Publication date: 6 August 2004
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s1570-8667(03)00024-8
complexity; Distributed computing; Leader election; Consensus; Communication complexity; Bit complexity; Message
68M14: Distributed systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the total\(_k\)-diameter of connection networks
- Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
- Distributed network protocols
- Distributed algorithms for finding centers and medians in networks
- Lower bounds on communication complexity in distributed computer networks
- Impossibility of distributed consensus with one faulty process
- Decentralized extrema-finding in circular configurations of processors
- Communication Complexity