Exact communication costs for consensus and leader in a tree

Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


We continue the study of communication costs of Consensus and Leader initiated in a previous paper. We deal with all scenarios with linear complexity in a tree topology, and prove exact (as opposed to asymptotic) tight bounds for the bit and message complexities. A particular scenario depends on whether the tree size or the size parity is known to the processors.

Original languageEnglish
Pages (from-to)167-183
Number of pages17
JournalJournal of Discrete Algorithms
Issue number2
StatePublished - 1 Jan 2003


  • BSP model
  • Broadcast
  • H-PRAM
  • Lower bounds
  • Parallel computing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Exact communication costs for consensus and leader in a tree'. Together they form a unique fingerprint.

Cite this