no. 1
Construction of very hard functions for multiparty communication complexity
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 1, pp. 61-75. 
@article{ITA_2000__34_1_61_0,
     author = {Ma\v{n}uch, J\'an},
     title = {Construction of very hard functions for multiparty communication complexity},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {61--75},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {1},
     year = {2000},
     mrnumber = {1771130},
     zbl = {0971.68065},
     language = {en},
     url = {http://www.numdam.org/item/ITA_2000__34_1_61_0/}
}
TY  - JOUR
AU  - Maňuch, Ján
TI  - Construction of very hard functions for multiparty communication complexity
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 61
EP  - 75
VL  - 34
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_2000__34_1_61_0/
LA  - en
ID  - ITA_2000__34_1_61_0
ER  - 
%0 Journal Article
%A Maňuch, Ján
%T Construction of very hard functions for multiparty communication complexity
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 61-75
%V 34
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_2000__34_1_61_0/
%G en
%F ITA_2000__34_1_61_0
Maňuch, Ján. Construction of very hard functions for multiparty communication complexity. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 1, pp. 61-75. http://www.numdam.org/item/ITA_2000__34_1_61_0/

[1] L. Babai, N. Nisan and M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences, Proceedings, 21st ACM STOC (1989).

[2] N. Blum, A Boolean function requiring 3n network size. Theoret. Comput. Sci. 28 (1984) 337-345. | MR | Zbl

[3] A. K. Chandra, M. L. Furst and R. J. Lipton, Multi-party protocols, Proceedings, 15th ACM STOC (1983) 94-99.

[4] D. Dolev and T. Feder, Multiparty communication complexity, Proceedings, 30th IEEE FOCS (1989) 428-433.

[5] D. Dolev and T. Feder, Determinism vs. nondeterminism in multiparty communication complexity. SIAM J. Comput. 21 (1992) 89-893. | MR | Zbl

[6] P. Ďuriš and J. D. P. Rolim, A lower bound on the multiparty communication complexity, STACS'95. Springer-Verlag, Lecture Notes in Comput. Sci. 900 (1995) 350-360. | MR

[7] P. Ďuriš, Multiparty communication complexity and very hard functions (to appear). | MR | Zbl

[8] J. Hromkovič, Communication complexity and parallel Computing, An EATCS Series. Springer (1997). | MR | Zbl

[9] E. Kushilevitz and N. Nisan, Communication complexity. Cambridge Univ. Press, xiii (1997). | MR | Zbl

[10] R. J. Lipton and R. Sedgewick, Lower bounds for VLSI, Proceedings, 13th ACM STOC (1981) 300-307.

[11] O. B. Lupanov, Ob odnom metode sinteza skhem (Russian). Izv. Vyssh. Uchebn. Zaved., Radiofizika 1 (1958) 120-140.

[12] C. Shannon, The synthesis of two-terminal switching circuits. Bell Syst. Techn. J. 28 (1949) 59-98. | MR

[13] A. C. Yao, The entropic limitations on VLSI computations, Proceedings, 13th ACM STOC (1981) 308-311.