Lee T., Zhang Sh., “Composition Theorems in Communication Complexity”, Automata, Languages and Programming, Lecture Notes in Computer Science, 6198, no. I, 2010, 475–489
Rahul Jain, Hartmut Klauck, 2010 IEEE 25th Annual Conference on Computational Complexity, 2010, 247
Arkadev Chattopadhyay, Toniann Pitassi, “The story of set disjointness”, SIGACT News, 41:3 (2010), 59
Hartmut Klauck, Proceedings of the forty-second ACM symposium on Theory of computing, 2010, 77
François Le Gall, “Exponential Separation of Quantum and Classical Online Space Complexity”, Theory Comput. Syst., 45:2 (2009), 188–202
Linial N., Shraibman A., “Lower bounds in communication complexity based on factorization norms”, Random Structures Algorithms, 34:3 (2009), 368–394
Sherstov A. A., “Separating $\mathsf{AC}^0$ from depth-2 majority circuits”, SIAM J. Comput., 38:6 (2009), 2113–2129
Lee Troy, Shraibman Adi, “Disjointness is hard in the multiparty number-on-the-forehead model”, Comput. Complexity, 18:2 (2009), 309–336
Tani S., Nakanishi M., Yamashita Sh., “Multi-party quantum communication complexity with routed messages”, IEICE Transactions on Information and Systems, E92D:2 (2009), 191–199
Zhang Zhiqiang, Shi Yaoyun, “Communication complexities of symmetric XOR functions”, Quantum Inf. Comput., 9:3-4 (2009), 255–263