Gossip-based aggregate computation: computing faster with non address-oblivious schemes

Roberto Di Pietro, Pietro Michiardi. Gossip-based aggregate computation: computing faster with non address-oblivious schemes. In Rida A. Bazzi, Boaz Patt-Shamir, editors, Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008. pages 442, ACM, 2008. [doi]

@inproceedings{PietroM08,
  title = {Gossip-based aggregate computation: computing faster with non address-oblivious schemes},
  author = {Roberto Di Pietro and Pietro Michiardi},
  year = {2008},
  doi = {10.1145/1400751.1400837},
  url = {http://doi.acm.org/10.1145/1400751.1400837},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/PietroM08},
  cites = {0},
  citedby = {0},
  pages = {442},
  booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008},
  editor = {Rida A. Bazzi and Boaz Patt-Shamir},
  publisher = {ACM},
  isbn = {978-1-59593-989-0},
}