Near-Constant-Time Distributed Algorithms on a Congested Clique

James W. Hegeman, Sriram V. Pemmaraju, Vivek Sardeshmukh. Near-Constant-Time Distributed Algorithms on a Congested Clique. In Fabian Kuhn, editor, Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings. Volume 8784 of Lecture Notes in Computer Science, pages 514-530, Springer, 2014. [doi]

@inproceedings{HegemanPS14,
  title = {Near-Constant-Time Distributed Algorithms on a Congested Clique},
  author = {James W. Hegeman and Sriram V. Pemmaraju and Vivek Sardeshmukh},
  year = {2014},
  doi = {10.1007/978-3-662-45174-8_35},
  url = {http://dx.doi.org/10.1007/978-3-662-45174-8_35},
  researchr = {https://researchr.org/publication/HegemanPS14},
  cites = {0},
  citedby = {0},
  pages = {514-530},
  booktitle = {Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12-15, 2014. Proceedings},
  editor = {Fabian Kuhn},
  volume = {8784},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-45173-1},
}