Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen. The NOF Multiparty Communication Complexity of Composed Functions. Electronic Colloquium on Computational Complexity (ECCC), 18:155, 2011. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: The NOF Multiparty Communication Complexity of Composed FunctionsAnil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen. icalp 2012: 13-24 [doi] The NOF Multiparty Communication Complexity of Composed FunctionsAnil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen. cc, 24(3):645-694, 2015. [doi]
The following publications are possibly variants of this publication: