N. Alon and J. H. Spencer, The probabilistic method, 2000.

L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity theory, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.337-347, 1986.
DOI : 10.1109/SFCS.1986.15

L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs, Journal of Computer and System Sciences, vol.45, issue.2, pp.204-232, 1992.
DOI : 10.1016/0022-0000(92)90047-M

F. R. Chung and P. Tetali, Communication Complexity and Quasi Randomness, SIAM Journal on Discrete Mathematics, vol.6, issue.1, pp.110-123, 1993.
DOI : 10.1137/0406009
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.8657

]. P. Duri?, J. Hromkovi?, S. Jukna, M. Sauerhoff, and G. Schnitger, On multi-partition communication complexity, Information and Computation, vol.194, issue.1, pp.49-75, 2004.
DOI : 10.1016/j.ic.2004.05.002

V. Grolmusz, The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal, Information and Computation, vol.112, issue.1, pp.51-54, 1994.
DOI : 10.1006/inco.1994.1051

V. Grolmusz, Separating the communication complexities of MOD m and MOD p circuits, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.307-313, 1995.
DOI : 10.1109/SFCS.1992.267764

J. Hromkovi?, J. Kari, and L. Kari, Some hierarchies for the communication complexity measures of cooperating grammar systems, Theoretical Computer Science, vol.127, issue.1, pp.123-147, 1994.
DOI : 10.1016/0304-3975(94)90103-1

J. Kollár, L. Rónyai, and T. Szabó, Norm-graphs and bipartite tur???n numbers, Combinatorica, vol.17, issue.3, pp.399-406, 1996.
DOI : 10.1007/BF01261323

A. Lubotzky, R. Phillips, R. , and P. Sarnak, Ramanujan graphs, Combinatorica, vol.4, issue.3, pp.261-277, 1988.
DOI : 10.1007/BF02126799

E. Kushilevitz and N. Nisan, Communication Complexity, 1997.

G. A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Problems of Information Transmission, vol.24, pp.39-46, 1988.

C. H. Papadimitriou and M. Sipser, Communication complexity, Journal of Computer and System Sciences, vol.28, issue.2, pp.260-269, 1984.
DOI : 10.1016/0022-0000(84)90069-2

T. Pitassi, Best-Partition Multiparty Communication Complexity Course notes for Foundations of Communication Complexity, Fall, 2009.