Kothari P.K., Meka R., Raghavendra P., “Approximating Rectangles By Juntas and Weakly-Exponential Lower Bounds For Lp Relaxations of Csps”, Stoc'17: Proceedings of the 49Th Annual Acm Sigact Symposium on Theory of Computing, Annual Acm Symposium on Theory of Computing, eds. Hatami H., McKenzie P., King V., Assoc Computing Machinery, 2017, 590–603
Montanaro A., “the Quantum Complexity of Approximating the Frequency Moments”, Quantum Inform. Comput., 16:13-14 (2016), 1169–1190
Lee T., Leonardos N., Saks M., Wang F., “Hellinger volume and number-on-the-forehead communication complexity”, J. Comput. Syst. Sci., 82:6 (2016), 1064–1074
Goos M., Lovett Sh., Meka R., Watson T., Zuckerman D., “Rectangles Are Nonnegative Juntas”, SIAM J. Comput., 45:5 (2016), 1835–1869
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