Near-Constant-Time Distributed Algorithms on a Congested Clique. Hegeman, J. W., Pemmaraju, S. V., & Sardeshmukh, V. In DISC, volume 8784, of Lecture Notes in Computer Science, pages 514-530, 2014. Springer.
Near-Constant-Time Distributed Algorithms on a Congested Clique. [link]Link  Near-Constant-Time Distributed Algorithms on a Congested Clique. [link]Paper  bibtex   
@inproceedings{conf/wdag/HegemanPS14,
  added-at = {2014-09-30T00:00:00.000+0200},
  author = {Hegeman, James W. and Pemmaraju, Sriram V. and Sardeshmukh, Vivek},
  biburl = {http://www.bibsonomy.org/bibtex/221697776e9764f6fe2ca8e14dcfa44a5/dblp},
  booktitle = {DISC},
  crossref = {conf/wdag/2014},
  editor = {Kuhn, Fabian},
  ee = {http://dx.doi.org/10.1007/978-3-662-45174-8_35},
  interhash = {743f4cb8600300fdd6f8c266aa38fa5b},
  intrahash = {21697776e9764f6fe2ca8e14dcfa44a5},
  isbn = {978-3-662-45173-1},
  keywords = {dblp},
  pages = {514-530},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2015-06-18T19:47:31.000+0200},
  title = {Near-Constant-Time Distributed Algorithms on a Congested Clique.},
  url = {http://dblp.uni-trier.de/db/conf/wdag/disc2014.html#HegemanPS14},
  volume = 8784,
  year = 2014
}

Downloads: 0