Lower Bounds on the Multiparty Communication Complexity

Journal of Computer and System Sciences

Volumn 56, Issue 1, 1998, Pages 90-95

  Ďuriš, Pavol ^a   Rolim, José D P ^b  

^a Physics and Informatics   (Slovakia)

^b UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS;

MULTIPARTY COMMUNICATION COMPLEXITY;

DATA COMMUNICATION SYSTEMS;

EID: 0031988943     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1547     Document Type: Article

References (7)

1. A. V. Aho, J. D. Ullman, and M. Y. Yanakakis, On notion of information transfer in VLSI, in "Proc. 15th ACM STOC, 1983," pp. 133-139.
2. D. Dolev and T. Feder, Multiparty communication complexity, in "Proc. 30th IEEE FOCS, 1989," pp. 428-433.
3. P. Ďuriš, Z. Galil, and G. Schnitger, Lower bounds on communication complexity, Inform. & Comput. 73 (1987), 1-22.
4. M. Fürer, The power of randomness in communication complexity, in "Proc. 19th ACM STOC, 1987," pp. 178-181.
5. K. Melhorn and E. M. Schmidt, Las Vegas is better in VLSI and distributed computing, in "Proc. 14th ACM STOC, 1982," pp. 330-337.
6. C. H. Papadimitriou and M. Sipser, Communication complexity, Comput. System Sci. 28 (1984), 260-269.
7. A. Yao, Some complexity questions related to distributive computing, in "Proc. 11th ACM STOC, 1979," pp. 209-213.