暂无分享,去创建一个
[1] Qin Zhang,et al. Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy , 2011, SIAM J. Comput..
[2] Phuong Nguyen,et al. The NOF Multiparty Communication Complexity of Composed Functions , 2012, computational complexity.
[3] Eyal Kushilevitz,et al. Choosing, Agreeing, and Eliminating in Communication Complexity , 2010, computational complexity.
[4] Alexander A. Sherstov. The multiparty communication complexity of set disjointness , 2012, STOC '12.
[5] Rahul Jain,et al. A direct product theorem for bounded-round public-coin randomized communication complexity , 2012, ArXiv.
[6] Rahul Jain,et al. New Strong Direct Product Results in Communication Complexity , 2015, Electron. Colloquium Comput. Complex..
[7] Eyal Kushilevitz,et al. Partition arguments in multiparty communication complexity , 2009, Theor. Comput. Sci..
[8] A. Razborov. Communication Complexity , 2011 .
[9] Toniann Pitassi,et al. Separating Deterministic from Randomized Multiparty Communication Complexity , 2010, Theory Comput..
[10] Emanuele Viola,et al. Improved Separations between Nondeterministic and Randomized Multiparty Communication , 2008, TOCT.
[11] Xi Chen,et al. Direct Sums in Randomized Communication Complexity , 2009, Electron. Colloquium Comput. Complex..
[12] Arkadev Chattopadhyay,et al. Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..
[13] Troy Lee,et al. Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.
[14] Amit Chakrabarti,et al. Lower Bounds for Multi-Player Pointer Jumping , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[15] Avi Wigderson,et al. A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness , 2006, computational complexity.
[16] André Gronemeier. NOF-Multiparty Information Complexity Bounds for Pointer Jumping , 2006, MFCS.
[17] A. Gál,et al. Lower bound methods for multiparty communication complexity , 2006 .
[18] Andris Ambainis,et al. The communication complexity of enumeration, elimination, and selection , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.
[19] Vince Grolmusz. On multi-party communication complexity of random functions , 1993 .
[20] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[21] Eyal Kushilevitz,et al. Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.
[22] T. Feder,et al. Amortized communication complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[23] Ran Raz,et al. Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[24] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[25] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.