ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Tight Network Topology Dependent Bounds on Rounds of Communication
Article URLs:
Alternative Article URLs:
Authors: Arkadev Chattopadhyay
  • Tata Institute of Fundamental Research, School of Technology and Computer Science
Michael Langberg
  • State University of New York at Buffalo, Department of Electrical Engineering
Shi Li
  • State University of New York at Buffalo, Department of Computer Science and Engineering
Atri Rudra
  • State University of New York at Buffalo, Department of Computer Science and Engineering
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1526771, 1566356, 1319402
DBLP Key: conf/soda/ChattopadhyayLL17
Author Comments:

Discuss this paper and its artifacts below