N. Alon, T. Kaufman, M. Krivelevich, and D. Ron, Testing Triangle-Freeness in General Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.2, pp.786-819, 2008.
DOI : 10.1137/07067917X

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. Bmn-+-11, M. Becker, N. Matamala, I. Nisse, K. Rapaport et al., Adding a referee to an interconnection network : What can(not) be computed in one round The art of uninformed decisions : A primer to property testing Property testing in bounded degree graphs, 25th IEEE Int. Parallel & Dist. Processing Symp. (IPDPS)GW09] S. Grumbach and Z. Wu. Logical locality entails frugal distributed computation over graphs 35th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG), pp.97-126302, 2001.

F. Kuhn, T. Moscibroda, and R. Wattenhofer, What cannot be computed locally ! [Lin92] N. Linial. Locality in distributed graph algorithms, 23rd ACM Symp. on Principles of Distributed Computing (PODC), pp.300-309193, 1992.
DOI : 10.1145/1011767.1011811
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5623

P. Bro-miltersen, N. Nisan, S. Safra, and A. Wigderson, On data structures and asymmetric communication complexity [Pel00] D. Peleg. Distributed computing : a locality-sensitive approach, Proceedings of the 27th Annual ACM Symposium on Theory of Computing (STOC), pp.103-111615, 1981.