论文信息 - On Communication Games with More than Two Players

On Communication Games with More than Two Players

Electronic copies of technical reports are available: Via FTP: URL ftp://ftp.informatik.uni-trier.de/pub/Users-Root/reports Via WWW: URL http://www.informatik.uni-trier.de/Reports/Current.html Via email: Send a mail to ftpmail@ftp.informatik.uni-trier.de, subject ’HELP’, for detailed instructions Printed copies: Trierer Forschungsberichte Fachbereich IV Mathematik / Informatik Universitat Trier ..

Stasys Jukna

[1] Pavel Pudlák,et al. On the Communication Complexity of Planarity , 1989, FCT.

[2] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[3] Zvi Galil,et al. Lower bounds on communication complexity , 1984, STOC '84.

[4] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.

[5] Joseph JáJá. The VLSI Complexity of Selected Graph Problems , 1984, JACM.

[6] Wolfgang Maass,et al. On the communication complexity of graph properties , 1988, STOC '88.