The communication complexity of addition

Emanuele Viola. The communication complexity of addition. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 632-651, SIAM, 2013. [doi]

@inproceedings{Viola13,
  title = {The communication complexity of addition},
  author = {Emanuele Viola},
  year = {2013},
  url = {http://knowledgecenter.siam.org/0236-000048/},
  researchr = {https://researchr.org/publication/Viola13},
  cites = {0},
  citedby = {0},
  pages = {632-651},
  booktitle = {Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013},
  editor = {Sanjeev Khanna},
  publisher = {SIAM},
}