Sherstov A.A., “The Multiparty Communication Complexity of Set Disjointness”, SIAM J. Comput., 45:4, SI (2016), 1450–1489
Braverman M., Garg A., Ko Y.K., Mao J., Touchette D., “Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of Disjointness”, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) (Berkeley, CA, USA), IEEE, 2015, 773–791
Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen, “The NOF Multiparty Communication Complexity of Composed Functions”, comput. complex, 2014
Sherstov A.A., “Communication Complexity Theory: Thirty-Five Years of Set Disjointness”, Mathematical Foundations of Computer Science 2014, Pt I, Lecture Notes in Computer Science, 8634, eds. CsuhajVarju E., Dietzfelbinger M., Esik Z., Springer-Verlag Berlin, 2014, 24–43
Briet J., Buhrman H., Lee T., Vidick T., “Multipartite Entanglement in Xor Games”, Quantum Inform. Comput., 13:3-4 (2013), 334–360
Harry Buhrman, Serge Fehr, Christian Schaffner, Florian Speelman, Proceedings of the 4th conference on Innovations in Theoretical Computer Science, 2013, 145
Paul Beame, Trinh Huynh, “Multiparty Communication Complexity and Threshold Circuit Size of $\ensuremathAC^0$”, SIAM J. Comput, 41:3 (2012), 484
Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen, Lecture Notes in Computer Science, 7391, Automata, Languages, and Programming, 2012, 13
Anil Ada, Omar Fawzi, Hamed Hatami, Lecture Notes in Computer Science, 7408, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012, 338
Ashley Montanaro, Harumichi Nishimura, Rudy Raymond, “Unbounded-error quantum query complexity”, Theoretical Computer Science, 2011