Broadcast Extensions with Optimal Communication and Round Complexity

Article Details
Title:	Broadcast Extensions with Optimal Communication and Round Complexity
Article URLs:	https://doi.org/10.1145/2933057.2933082
Alternative Article URLs:
Authors:	Chaya Ganesh	New York University, Department of Computer Science
Authors:	Arpita Patra	Indian Institute of Science, Department of Computer Science and Automation
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/podc/GaneshP16
Author Comments:

ACM Principles of Distributed Computing, PODC 2016