APA (7th ed.) Citation

Ada, A., Chattopadhyay, A., Fawzi, O., & Nguyen, P. (2015). The NOF Multiparty Communication Complexity of Composed Functions. Computational complexity, 24(3), 645-694. https://doi.org/10.1007/s00037-013-0078-4

Chicago Style (17th ed.) Citation

Ada, Anil, Arkadev Chattopadhyay, Omar Fawzi, and Phuong Nguyen. "The NOF Multiparty Communication Complexity of Composed Functions." Computational Complexity 24, no. 3 (2015): 645-694. https://doi.org/10.1007/s00037-013-0078-4.

MLA (9th ed.) Citation

Ada, Anil, et al. "The NOF Multiparty Communication Complexity of Composed Functions." Computational Complexity, vol. 24, no. 3, 2015, pp. 645-694, https://doi.org/10.1007/s00037-013-0078-4.