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]

Authors

Ofer Biran

This author has not been identified. Look up 'Ofer Biran' in Google

Shlomo Moran

This author has not been identified. Look up 'Shlomo Moran' in Google

Shmuel Zaks

This author has not been identified. Look up 'Shmuel Zaks' in Google