Exact communication costs for consensus and leader in a tree
type: Item
instance of: scholarly article
title: Exact communication costs for consensus and leader in a tree
zbMATH Open document ID: 1074.68003
DOI: 10.1016/S1570-8667(03)00024-8
author: Shlomo Moran
author: Sergio Rajsbaum
author: Yefim Dinitz
published in: Journal of Discrete Algorithms
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 2082313
zbMATH Keywords: Distributed computing
zbMATH Keywords: Consensus
zbMATH Keywords: Leader election
zbMATH Keywords: Bit complexity
zbMATH Keywords: Message
zbMATH Keywords: complexity
zbMATH Keywords: Communication complexity
MaRDI profile type: Publication
cites work: Q4527005
cites work: On the total\(_k\)-diameter of connection networks
cites work: Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
cites work: Impossibility of distributed consensus with one faulty process
cites work: Decentralized extrema-finding in circular configurations of processors
cites work: Distributed algorithms for finding centers and medians in networks
cites work: Q4228448
cites work: Communication Complexity
cites work: Q3126969
cites work: Distributed network protocols
cites work: Q4325545
cites work: Lower bounds on communication complexity in distributed computer networks
full work available at URL: s1570-8667(03)00024-8
OpenAlex ID: W1971367832
description: scientific article; zbMATH DE number 2082313