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, pp.137-166, 2004.
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. M. 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

P. Fraigniaud, A. Korman, and D. Peleg, Towards a complexity theory for local distributed computing, Journal of the ACM, vol.60, issue.5, p.35, 2013.
DOI : 10.1145/2499228

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

A. V. Kostochka, Lower bound of the hadwiger number of graphs by their average degree, Combinatorica, vol.7, issue.4, pp.307-316, 1984.
DOI : 10.1007/BF02579141

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

N. Linial, Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.
DOI : 10.1137/0221015

M. Naor and L. Stockmeyer, What Can be Computed Locally?, SIAM Journal on Computing, vol.24, issue.6, pp.1259-1277, 1995.
DOI : 10.1137/S0097539793254571

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.902

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

A. Thomason, An extremal function for contractions of graphs, Math. Proc. Cambridge Philos. Soc. 95, pp.261-265, 1984.
DOI : 10.1007/BF01350657

A. Thomason, The Extremal Function for Complete Minors, Journal of Combinatorial Theory, Series B, vol.81, issue.2, pp.318-338, 2001.
DOI : 10.1006/jctb.2000.2013

E. Wright, Equal sums of like powers, Bull. Amer. Math. Soc, vol.8, pp.755-757, 1948.