Broadcast Extensions with Optimal Communication and Round Complexity. Ganesh, C. & Patra, A. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 371–380, 2016. ACM.
Broadcast Extensions with Optimal Communication and Round Complexity [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/podc/GaneshP16,
  author       = {Chaya Ganesh and
                  Arpita Patra},
  editor       = {George Giakkoupis},
  title        = {Broadcast Extensions with Optimal Communication and Round Complexity},
  booktitle    = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed
                  Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},
  pages        = {371--380},
  publisher    = {{ACM}},
  year         = {2016},
  url          = {https://doi.org/10.1145/2933057.2933082},
  doi          = {10.1145/2933057.2933082},
  timestamp    = {Tue, 06 Nov 2018 11:07:19 +0100},
  biburl       = {https://dblp.org/rec/conf/podc/GaneshP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0