L. Babai, A. Gál, P. G. Kimmel, and S. V. Lokam, Communication Complexity of Simultaneous Messages, SIAM Journal on Computing, vol.33, issue.1
DOI : 10.1137/S0097539700375944

F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan et al., Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round, 2011 IEEE International Parallel & Distributed Processing Symposium, pp.508-514, 2011.
DOI : 10.1109/IPDPS.2011.55
URL : https://hal.archives-ouvertes.fr/inria-00528733

A. K. Chandra, M. L. Furst, and R. J. Lipton, Multi-party protocols, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.94-99, 1983.
DOI : 10.1145/800061.808737

J. Feldman, S. Muthukrishnan, A. Sidiropoulos, C. Stein, and Z. Svitkina, On distributing symmetric streaming computations, ACM Transactions on Algorithms, vol.6, issue.4, pp.1-6619, 2010.
DOI : 10.1145/1824777.1824786
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.305

S. Grumbach and Z. Wu, Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract), Proceedings of 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.154-165, 2009.
DOI : 10.1007/978-3-642-11409-0_14

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally!, Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing , PODC '04, pp.300-309, 2004.
DOI : 10.1145/1011767.1011811
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5623

D. Peleg, Distributed computing: a locality-sensitive approach, SIAM Monographs on Discrete Mathematics and Applications, 2000.
DOI : 10.1137/1.9780898719772