Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks

Ofer Biran, Shlomo Moran, Shmuel Zaks. Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theoretical Computer Science, 145(1&2):271-290, 1995. [doi]

@article{BiranMZ95,
  title = {Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks},
  author = {Ofer Biran and Shlomo Moran and Shmuel Zaks},
  year = {1995},
  doi = {10.1016/0304-3975(94)00157-E},
  url = {http://dx.doi.org/10.1016/0304-3975(94)00157-E},
  researchr = {https://researchr.org/publication/BiranMZ95},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {145},
  number = {1&2},
  pages = {271-290},
}